Matthew Cook: Difference between revisions
Jump to navigation
Jump to search
→External links: MathGenealogy |
add ref |
||
| Line 1: | Line 1: | ||
{{stub}} | {{stub}} | ||
{{Person|name=Matthew Cook|born=February 7, 1970|nat=American|alma=University of Illinois, California Institute of Technology|inst=Institute for Neuroinformatics (Zurich, Switzerland)}} | {{Person|name=Matthew Cook|born=February 7, 1970|nat=American|alma=University of Illinois, California Institute of Technology|inst=Institute for Neuroinformatics (Zurich, Switzerland)}} | ||
'''Matthew Cook''' is a mathematician and computer scientist who proved [[Stephen Wolfram]]'s conjecture that the [[Rule 110]] [[one-dimensional cellular automaton]] is [[Turing complete]] in 1994 (published in 2004). | '''Matthew Cook''' is a mathematician and computer scientist who proved [[Stephen Wolfram]]'s conjecture that the [[Rule 110]] [[one-dimensional cellular automaton]] is [[Turing complete]] in 1994 (published in 2004).<ref>{{cite web|url=https://scholar.google.com/citations?view_op=view_citation&hl=en&user=eFVeYUIAAAAJ&citation_for_view=eFVeYUIAAAAJ:u5HHmVD_uO8C |year=2004|title=Universality in elementary cellular automata|publisher=Complex Systems Publications|author=Cook, Matthew}}</ref> | ||
Cook also did pioneering work in 2000 in defining and distinguishing between pseudo- and quasi-[[still life]]s in the [[Game of Life]].<ref>{{cite web|url=http://www.csun.edu/~kme52026/mcook.html|year=2000|title=Still life theory|publisher=Santa Fe Institute's Fellows-at-Large Program 2000|author=Cook, Matthew}}</ref><ref>{{cite web|url=https://academic.oup.com/book/40819/chapter-abstract/348790306?redirectedFrom=fulltext |year=2003|title=New Constructions in Cellular Automata: Still life theory, pages 93–118|publisher=Santa Fe Institute Studies in the Sciences of Complexity, Oxford University Press |author=Cook, Matthew}}</ref> | Cook also did pioneering work in 2000 in defining and distinguishing between pseudo- and quasi-[[still life]]s in the [[Game of Life]].<ref>{{cite web|url=http://www.csun.edu/~kme52026/mcook.html|year=2000|title=Still life theory|publisher=Santa Fe Institute's Fellows-at-Large Program 2000|author=Cook, Matthew}}</ref><ref>{{cite web|url=https://academic.oup.com/book/40819/chapter-abstract/348790306?redirectedFrom=fulltext |year=2003|title=New Constructions in Cellular Automata: Still life theory, pages 93–118|publisher=Santa Fe Institute Studies in the Sciences of Complexity, Oxford University Press |author=Cook, Matthew}}</ref> | ||
Revision as of 20:03, 11 December 2022
|
This article is a stub. You can help LifeWiki by expanding it. |
| Matthew Cook | |
| Born | February 7, 1970 |
|---|---|
| Residence | Unknown |
| Nationality | American |
| Institutions | Institute for Neuroinformatics (Zurich, Switzerland) |
| Alma mater | University of Illinois, California Institute of Technology |
Matthew Cook is a mathematician and computer scientist who proved Stephen Wolfram's conjecture that the Rule 110 one-dimensional cellular automaton is Turing complete in 1994 (published in 2004).[1]
Cook also did pioneering work in 2000 in defining and distinguishing between pseudo- and quasi-still lifes in the Game of Life.[2][3]
See also
References
- ↑ Cook, Matthew (2004). "Universality in elementary cellular automata". Complex Systems Publications.
- ↑ Cook, Matthew (2000). "Still life theory". Santa Fe Institute's Fellows-at-Large Program 2000.
- ↑ Cook, Matthew (2003). "New Constructions in Cellular Automata: Still life theory, pages 93–118". Santa Fe Institute Studies in the Sciences of Complexity, Oxford University Press.
External links