Cristopher Moore

Last updated
Cristopher Moore
BornMarch 12, 1968 (1968-03-12) (age 56)
New Brunswick, New Jersey
NationalityAmerican
Alma materNorthwestern University (B.S., 1986)
Cornell University (Ph.D., 1991)
Scientific career
Fields Computer Science and Physics
Institutions Santa Fe Institute
Doctoral advisor Philip Holmes
Doctoral students Aaron Clauset

Cristopher David Moore, known as Cris Moore, (born March 12, 1968, in New Brunswick, New Jersey) [1] is an American computer scientist, mathematician, and physicist. He is resident faculty at the Santa Fe Institute, and was formerly a full professor at the University of New Mexico. He is an elected Fellow of the American Physical Society, the American Mathematical Society, and the American Association for the Advancement of Science.

Contents

Biography

Moore did his undergraduate studies at Northwestern University, graduating in 1986. [1] He earned his Ph.D. in 1991 from Cornell University under the supervision of Philip Holmes. [2] After postdoctoral studies at the Santa Fe Institute, he joined the institute as a research faculty member in 1998, and moved to the University of New Mexico in 2000 as an assistant professor. He received tenure there in 2005. In 2007 he became a research professor at the Santa Fe Institute again, while retaining his University of New Mexico affiliation, and in 2008 he was promoted to full professor at UNM. His primary appointment was in the Department of Computer Science, with a joint appointment in the UNM Department of Physics and Astronomy. In 2012, Moore left the University of New Mexico and became full-time resident faculty at the Santa Fe Institute. [1]

Moore has also served on the Santa Fe, New Mexico, city council from 1994 to 2002, affiliated with the Green Party of New Mexico. [1] [3]

Research

In 1993, Moore found a novel solution to the three-body problem, showing that it is possible in Newtonian mechanics for three equal-mass bodies to follow each other around a shared orbit along a figure-eight shaped curve. [4] Moore's results were found through numerical computations, and they were made mathematically rigorous in 2000 by Alain Chenciner and Richard Montgomery and shown computationally to be stable by Carlès Simo. Later researchers showed that similar solutions to the three-body problem are also possible under general relativity, Einstein's more accurate description of the effects of gravitation on moving bodies. After his original work on the problem, Moore collaborated with Michael Nauenberg to find many complex orbits for systems of more than three bodies, including one system in which twelve bodies trace out the four equatorial cycles of a cuboctahedron. [5] [6] [7] [8]

In 2001, Moore and John M. Robson showed that the problem of tiling one polyomino with copies of another is NP-complete. [9] [10]

Moore has also been active in the field of network science, with many notable publications in the field. In work with Aaron Clauset, David Kempe, and Dimitris Achlioptas, Moore showed that the appearance of power laws in the degree distribution of networks can be illusory: network models such as the Erdős–Rényi model, whose degree distribution does not obey a power law, may nevertheless appear to exhibit one when measured using traceroute-like tools. [11] [12] In work with Clauset and Mark Newman, Moore developed a probabilistic model of hierarchical clustering for complex networks, and showed that their model predicts clustering robustly in the face of changes to the link structure of the network. [13] [14] [15] [16]

Other topics in Moore's research include modeling undecidable problems by physical systems, [17] [18] phase transitions in random instances of the Boolean satisfiability problem, [19] the unlikelihood of success in the search for extraterrestrial intelligence due to the indistinguishability of advanced signaling technologies from random noise, [20] [21] [22] the inability of certain types of quantum algorithm to solve graph isomorphism, [23] and attack-resistant quantum cryptography. [24] [25]

Awards and honors

In 2013, Moore became the inaugural member of the Zachary Karate Club Club. [26] In 2014, Moore was elected as a Fellow of the American Physical Society for his fundamental contributions at the interface between nonlinear physics, statistical physics and computer science, including complex network analysis, phase transitions in NP-complete problems, and the computational complexity of physical simulation. [27] In 2015 he was elected as a fellow of the American Mathematical Society. [28] In 2017 he was elected as a Fellow of the American Association for the Advancement of Science. [29]

Selected publications

Related Research Articles

<span class="mw-page-title-main">Quantum computing</span> Technology that uses quantum mechanics

A quantum computer is a computer that takes advantage of quantum mechanical phenomena.

Hypercomputation or super-Turing computation is a set of hypothetical models of computation that can provide outputs that are not Turing-computable. For example, a machine that could solve the halting problem would be a hypercomputer; so too would one that could correctly evaluate every statement in Peano arithmetic.

In quantum computing, a quantum algorithm is an algorithm that runs on a realistic model of quantum computation, the most commonly used model being the quantum circuit model of computation. A classical algorithm is a finite sequence of instructions, or a step-by-step procedure for solving a problem, where each step or instruction can be performed on a classical computer. Similarly, a quantum algorithm is a step-by-step procedure, where each of the steps can be performed on a quantum computer. Although all classical algorithms can also be performed on a quantum computer, the term quantum algorithm is generally reserved for algorithms that seem inherently quantum, or use some essential feature of quantum computation such as quantum superposition or quantum entanglement.

<span class="mw-page-title-main">Seth Lloyd</span> American mechanical engineer and physicist

Seth Lloyd is a professor of mechanical engineering and physics at the Massachusetts Institute of Technology.

<span class="mw-page-title-main">Artur Ekert</span> Polish-British physicist (born 1961)

Artur Konrad Ekert is a British-Polish professor of quantum physics at the Mathematical Institute, University of Oxford, professorial fellow in quantum physics and cryptography at Merton College, Oxford, Lee Kong Chian Centennial Professor at the National University of Singapore and the founding director of the Centre for Quantum Technologies (CQT). His research interests extend over most aspects of information processing in quantum-mechanical systems, with a focus on quantum communication and quantum computation. He is best known as one of the pioneers of quantum cryptography.

<span class="mw-page-title-main">Peter Coveney</span> British chemist

Peter V. Coveney is a British chemist who is Professor of Physical Chemistry, Honorary Professor of Computer Science, and the Director of the Centre for Computational Science (CCS) and Associate Director of the Advanced Research Computing Centre at University College London (UCL). He is also a Professor of Applied High Performance Computing at University of Amsterdam (UvA) and Professor Adjunct at the Yale School of Medicine, Yale University. He is a Fellow of the Royal Academy of Engineering and Member of Academia Europaea.

In physics and cosmology, the mathematical universe hypothesis (MUH), also known as the ultimate ensemble theory, is a speculative "theory of everything" (TOE) proposed by cosmologist Max Tegmark. According to the hypothesis, the universe is a mathematical object in and of itself. Furthermore, Tegmark suggests that not only is the universe mathematical, but it is also computable.

A quantum Turing machine (QTM) or universal quantum computer is an abstract machine used to model the effects of a quantum computer. It provides a simple model that captures all of the power of quantum computation—that is, any quantum algorithm can be expressed formally as a particular quantum Turing machine. However, the computationally equivalent quantum circuit is a more common model.

Quantum annealing (QA) is an optimization process for finding the global minimum of a given objective function over a given set of candidate solutions, by a process using quantum fluctuations. Quantum annealing is used mainly for problems where the search space is discrete with many local minima; such as finding the ground state of a spin glass or the traveling salesman problem. The term "quantum annealing" was first proposed in 1988 by B. Apolloni, N. Cesa Bianchi and D. De Falco as a quantum-inspired classical algorithm. It was formulated in its present form by T. Kadowaki and H. Nishimori in 1998 though an imaginary-time variant without quantum coherence had been discussed by A. B. Finnila, M. A. Gomez, C. Sebenik and J. D. Doll in 1994.

<span class="mw-page-title-main">Community structure</span> Concept in graph theory

In the study of complex networks, a network is said to have community structure if the nodes of the network can be easily grouped into sets of nodes such that each set of nodes is densely connected internally. In the particular case of non-overlapping community finding, this implies that the network divides naturally into groups of nodes with dense connections internally and sparser connections between groups. But overlapping communities are also allowed. The more general definition is based on the principle that pairs of nodes are more likely to be connected if they are both members of the same community(ies), and less likely to be connected if they do not share communities. A related but different problem is community search, where the goal is to find a community that a certain vertex belongs to.

Mark Newman is an English–American physicist and Anatol Rapoport Distinguished University Professor of Physics at the University of Michigan, as well as an external faculty member of the Santa Fe Institute. He is known for his fundamental contributions to the fields of complex networks and complex systems, for which he was awarded the 2014 Lagrange Prize.

Daniel Amihud Lidar is the holder of the Viterbi Professorship of Engineering at the University of Southern California, where he is a professor of electrical engineering, chemistry, physics & astronomy. He is the director and co-founder of the USC Center for Quantum Information Science & Technology (CQIST), the director of the USC-IBM Quantum Innovation Center, as well as scientific director of the USC-Lockheed Martin Quantum Computing Center, notable for his research on control of quantum systems and quantum information processing.

<span class="mw-page-title-main">Ernesto Estrada (scientist)</span> Cuban-Spanish scientist

Ernesto Estrada is a Cuban-Spanish scientist. He has been Senior ARAID Researcher at the Institute of Mathematics and Applications at the University of Zaragoza, Spain since 2019. Before that he was the chair in Complexity Science, and full professor at the Department of Mathematics and Statistics of the University of Strathclyde, Glasgow, United Kingdom. He is known by his contributions in different disciplines, including mathematical chemistry and complex network theory.

Daniel L. Stein is an American physicist and Professor of Physics and Mathematics at New York University. From 2006 to 2012 he served as the NYU Dean of Science.

Aaron Clauset is an American computer scientist who works in the areas of Network Science, Machine Learning, and Complex Systems. He is currently a professor of computer science at the University of Colorado Boulder and is external faculty at the Santa Fe Institute.

Continuous-variable (CV) quantum information is the area of quantum information science that makes use of physical observables, like the strength of an electromagnetic field, whose numerical values belong to continuous intervals. One primary application is quantum computing. In a sense, continuous-variable quantum computation is "analog", while quantum computation using qubits is "digital." In more technical terms, the former makes use of Hilbert spaces that are infinite-dimensional, while the Hilbert spaces for systems comprising collections of qubits are finite-dimensional. One motivation for studying continuous-variable quantum computation is to understand what resources are necessary to make quantum computers more powerful than classical ones.

In quantum computing, a qubit is a unit of information analogous to a bit in classical computing, but it is affected by quantum mechanical properties such as superposition and entanglement which allow qubits to be in some ways more powerful than classical bits for some tasks. Qubits are used in quantum circuits and quantum algorithms composed of quantum logic gates to solve computational problems, where they are used for input/output and intermediate computations.

In quantum mechanics, the spectral gap of a system is the energy difference between its ground state and its first excited state. The mass gap is the spectral gap between the vacuum and the lightest particle. A Hamiltonian with a spectral gap is called a gapped Hamiltonian, and those that do not are called gapless.

<span class="mw-page-title-main">Florent Krzakala</span> French physicist and engineer

Florent Krzakala is a French physicist and applied mathematician, currently a professor at EPFL. His research focuses on the resolution of theoretical problems in physics, computer science, machine learning, statistics and signal processing using mathematical tools inspired by the field of statistical physics.

References

  1. 1 2 3 4 Curriculum vitae, retrieved 2023-05-31.
  2. ↑ Cristopher David Moore at the Mathematics Genealogy Project
  3. ↑ "Greens in N.M. weigh Nader presidential bid", Denver Post , April 2, 1996.
  4. ↑ Moore 1993.
  5. ↑ Casselman, Bill, Feature Column: A new solution to the three body problem – and more, American Mathematical Society .
  6. ↑ Petersen, Ivars (August 13, 2005) [April 7, 2001], MathTrek: Strange Orbits, ScienceNews .
  7. ↑ Cho, Adrian (4 May 2007), "Trick Three-Planet Orbit Remains True", Science Now , archived from the original on 14 August 2011.
  8. ↑ Pöppe, Christoph (January 2005), "Himmlisches Ballett", Spektrum der Wissenschaft (in German): 98–99.
  9. ↑ Moore & Robson 2001.
  10. ↑ Petersen, Ivars (September 25, 1999), "Math Trek: Tiling with Polyominoes", Science News .
  11. ↑ Achlioptas et al. 2005.
  12. ↑ Robinson, Sara (June 10, 2005), "Wanted: An Accurate Map of the Internet", SIAM News, 38 (5).
  13. ↑ Clauset, Newman & Moore 2004.
  14. ↑ Clauset, Moore & Newman 2008.
  15. ↑ Rehmeyer, Julie (June 2, 2008), "MathTrek: Communities of Communities of ...", ScienceNews .
  16. ↑ Redner, Sid (1 May 2008), "Networks: Teasing out the missing links", Nature , 453 (7191): 47–48, Bibcode:2008Natur.453...47R, doi: 10.1038/453047a , PMID   18451851, S2CID   205037682 .
  17. ↑ Moore 1990.
  18. ↑ Bennett, Charles H. (1990), "Undecidable dynamics" (PDF), Nature , 346 (6285): 606–607, Bibcode:1990Natur.346..606B, doi: 10.1038/346606a0 , S2CID   4329071 .
  19. ↑ Achlioptas & Moore 2002.
  20. ↑ Lachmann, Newman & Moore 2004.
  21. ↑ "Hello, Hello, Earth?", ScienceDaily , December 3, 2004.
  22. ↑ Is It Time to Scrap SETI?, ABC News, December 9, 2004.
  23. ↑ Moore, Russell & Sniady 2007.
  24. ↑ Dinh, Moore & Russell 2011.
  25. ↑ Rehmeyer, Julie (July 25, 2011), "Math Trek: New system offers way to defeat decryption by quantum computers" (PDF), Science News .
  26. ↑ Zachary Karate Club CLUB prize
  27. ↑ 2014 APS Fellow record, December 14, 2014
  28. ↑ 2016 Class of the Fellows of the AMS, American Mathematical Society , retrieved 2015-11-16.
  29. ↑ 2017 Fellows, American Association for the Advancement of Science, archived from the original on 2017-12-01, retrieved 2017-11-22
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.