|Fields||Computer Science and Physics|
|Institutions||Santa Fe Institute|
|Alma mater||Cornell University|
|Doctoral advisor||Philip Holmes|
|Doctoral students||Aaron Clauset|
Cristopher David Moore, known as Cris Moore, (born March 12, 1968 in New Brunswick, New Jersey) 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.
Moore did his undergraduate studies at Northwestern University. He earned his Ph.D. in 1991 from Cornell University under the supervision of Philip Holmes. 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. 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.
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. 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.
Moore has also been active in the new field of network science, also called complex networks, with many notable and early 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 complex 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. 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.
Other topics in Moore's research include modeling undecidable problems by physical systems, phase transitions in random instances of the Boolean satisfiability problem, the unlikelihood of success in the search for extraterrestrial intelligence due to the indistinguishability of advanced signaling technologies from random noise, the inability of certain types of quantum algorithm to solve graph isomorphism, and attack-resistant quantum cryptography.
- Moore, Cristopher (1990), "Unpredictability and undecidability in dynamical systems", Physical Review Letters 64 (20): 2354–2357, Bibcode:1990PhRvL..64.2354M, doi:10.1103/PhysRevLett.64.2354, PMID 10041691.
- Moore, Cristopher (1993), "Braids in classical dynamics", Physical Review Letters 70 (24): 3675–3679, Bibcode:1993PhRvL..70.3675M, doi:10.1103/PhysRevLett.70.3675, PMID 10053934.
- Moore, Cristopher; Crutchfield, James P. (2000), "Quantum automata and quantum grammars", Theoretical Computer Science 237 (1–2): 275–306, doi:10.1016/S0304-3975(98)00191-1, MR 1756213.
- Moore, C.; Robson, J. M. (2001), "Hard tiling problems with simple tiles", Discrete and Computational Geometry 26 (4): 573–590, arXiv:math/0003039, doi:10.1007/s00454-001-0047-6, MR 1863810.
- Achlioptas, D.; Moore, C. (2002), "The asymptotic order of the random k-SAT threshold", Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS '02), pp. 779–788, arXiv:cond-mat/0209622, doi:10.1109/SFCS.2002.1182003.
- Lachmann, Michael; Newman, M. E. J.; Moore, Cristopher (2004), "The physical limits of communication or Why any sufficiently advanced technology is indistinguishable from noise", American Journal of Physics 72 (10): 1290–1293, arXiv:cond-mat/9907500, Bibcode:2004AmJPh..72.1290L, doi:10.1119/1.1773578.
- Clauset, Aaron; Newman, M. E. J.; Moore, Cristopher (2004), "Finding community structure in very large networks", Physical Review E 70 (6): 066111, arXiv:cond-mat/0408187, Bibcode:2004PhRvE..70f6111C, doi:10.1103/PhysRevE.70.066111.
- Achlioptas, Dimitris; Clauset, Aaron; Kempe, David; Moore, Cristopher (2005), "On the bias of traceroute sampling: or, power-law degree distributions in regular graphs", Proceedings of the 37th ACM Symposium on Theory of Computing (STOC '05), pp. 694–703, arXiv:cond-mat/0503087, doi:10.1145/1060590.1060693.
- Moore, Cristopher; Russell, Alexander; Sniady, Piotr (2007), "On the impossibility of a quantum sieve algorithm for graph isomorphism", Proceedings of the 39th ACM Symposium on Theory of Computing (STOC '07), pp. 536–545, doi:10.1145/1250790.1250868.
- Clauset, Aaron; Moore, Cristopher; Newman, M. E. J. (2008), "Hierarchical structure and the prediction of missing links in networks", Nature 453 (7191): 98–101, arXiv:0811.0484, Bibcode:2008Natur.453...98C, doi:10.1038/nature06830.
- Dinh, Hang; Moore, Cristopher; Russell, Alexander (2011), "McEliece and Niederreiter cryptosystems that resist quantum Fourier sampling attacks", Advances in Cryptology – Crypto 2011, Lecture Notes in Computer Science, Springer, pp. 761–779, doi:10.1007/978-3-642-22792-9_43.
- Moore, Cristopher; Mertens, Stephan (2011), The Nature of Computation, Oxford: Oxford University Press, ISBN 978-0-19-923321-2, MR 2849868.
- Curriculum vitae, retrieved 2012-03-10.
- Christopher David Moore at the Mathematics Genealogy Project
- "Greens in N.M. weigh Nader presidential bid", Denver Post, April 2, 1996.
- Moore 1993.
- Casselman, Bill, Feature Column: A new solution to the three body problem – and more, American Mathematical Society.
- Petersen, Ivars (April 7, 2001, updated August 13, 2005), MathTrek: Strange Orbits, ScienceNews .
- Cho, Adrian (4 May 2007), "Trick Three-Planet Orbit Remains True", Science Now.
- Pöppe, Christoph (January 2005), "Himmlisches Ballett", Spektrum der Wissenschaft (in German): 98–99.
- Moore & Robson 2001.
- Petersen, Ivars (September 25, 1999), "Math Trek: Tiling with Polyominoes", Science News.
- Achlioptas et al. 2005.
- Robinson, Sara (June 10, 2005), "Wanted: An Accurate Map of the Internet", SIAM News 38 (5).
- Clauset, Newman & Moore 2004.
- Clauset, Moore & Newman 2008.
- Rehmeyer, Julie (June 2, 2008), "MathTrek: Communities of Communities of ...", ScienceNews.
- Redner, Sid (1 May 2008), "Networks: Teasing out the missing links", Nature 453: 47–48, Bibcode:2008Natur.453...47R, doi:10.1038/453047a.
- Moore 1990.
- Bennett, Charles H. (1990), "Undecidable dynamics", Nature 346 (6285): 606–607, Bibcode:1990Natur.346..606B, doi:10.1038/346606a0.
- Achlioptas & Moore 2002.
- Lachmann, Newman & Moore 2004.
- "Hello, Hello, Earth?", ScienceDaily, December 3, 2004.
- Is It Time to Scrap SETI?, ABC News, December 9, 2004.
- Moore, Russell & Sniady 2007.
- Dinh, Moore & Russell 2011.
- Rehmeyer, Julie (July 25, 2011), "Math Trek: New system offers way to defeat decryption by quantum computers", Science News.