Matthew Cook

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Matthew Cook (born February 7, 1970) is a mathematician and computer scientist who is best known for having proved Stephen Wolfram's conjecture that the Rule 110 cellular automaton is Turing-complete.

Biography[edit]

Cook was born in Morgantown, West Virginia and grew up in Evanston, Illinois. He is an alumnus of the Hampshire College Summer Studies in Mathematics program and completed his undergraduate studies at the University of Illinois and the Budapest Semesters in Mathematics program. In 1987, Cook qualified as a member of the six-person US team to the International Mathematical Olympiad and won a bronze medal. In 1990, Cook went to work for Wolfram Research, makers of the computer algebra system Mathematica. He did his doctoral work in Computation and Neural Systems at Caltech from 1999 to 2005. He is now at the Institute of Neuroinformatics at Zurich in Switzerland.

Work with Stephen Wolfram[edit]

In the 1990s Cook worked as a research assistant to Stephen Wolfram, assisting with work on Wolfram's book, A New Kind of Science. Among other things, he developed a proof showing that the Rule 110 cellular automaton is Turing-complete.

Cook presented his proof at the Santa Fe Institute conference CA98 before the publishing of Wolfram's book—an action that led Wolfram Research to accuse Cook of violating his NDA and resulted in the blocking of the publication of the proof in the conference proceedings. [1]

A New Kind of Science was released in 2002 with an outline of the proof. In 2004, Cook published his proof in Wolfram's journal Complex Systems.[2]

References[edit]

  1. ^ Martinez, Genaro J.; Seck Tuoh Mora, Juan; Chapa, Sergio; Lemaitre, Christian (April 2019). "Brief notes and history computing in Mexico during 50 years". International Journal of Parallel, Emergent and Distributed Systems. 35 (2): 185–192. arXiv:1905.07527. doi:10.1080/17445760.2019.1608990. S2CID 150262966. Retrieved 2020-04-15.
  2. ^ Cook, Matthew (2004). "Universality in Elementary Cellular Automata". Complex Systems. 15: 1–40. Archived (PDF) from the original on 28 May 2016.

External links[edit]