Matthew Cook: Difference between revisions
Jump to navigation
Jump to search
add ref |
added ext link |
||
| Line 1: | Line 1: | ||
{{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).<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> | '''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> | ||
| Line 11: | Line 10: | ||
<references /> | <references /> | ||
== External links == | == External links and further reading== | ||
*[https://en.wikipedia.org/wiki/Cellular_automaton Wikipedia: Cellular automaton] | * [https://en.wikipedia.org/wiki/Cellular_automaton Wikipedia: Cellular automaton] | ||
* [https://arxiv.org/abs/0906.3248 A Concrete View of Rule 110 Computation] M Cook - arXiv preprint arXiv:0906.3248, 2009 | |||
* {{MathGenealogy|id=204758|title=Matthew Cook}} | * {{MathGenealogy|id=204758|title=Matthew Cook}} | ||
{{DEFAULTSORT:Cook, Matthew}} | {{DEFAULTSORT:Cook, Matthew}} | ||
Revision as of 19:44, 13 December 2022
| 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 and further reading
- Wikipedia: Cellular automaton
- A Concrete View of Rule 110 Computation M Cook - arXiv preprint arXiv:0906.3248, 2009
- Matthew Cook at the Mathematics Genealogy Project