Matthew Cook - Revision history

Confocal: relink WP page, formatting

2023-08-16T22:36:21Z

relink WP page, formatting

← Older revision		Revision as of 22:36, 16 August 2023
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
	'''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>		\|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 name="ref1" />

	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 name="ref2" /><ref name="ref3" />

	== See also ==		== See also ==
Line 8:		Line 14:

	== References ==		== References ==
	<references />		<references>
			<ref name="ref1">{{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>
			<ref name="ref2">{{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 name="ref3">{{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>
			</references>

	== External links and further reading==		== External links and further reading==
	* {{LinkWikipedia\|~~Cellular_automaton~~\|name=~~Cellular automaton~~}}		* {{LinkWikipedia\|Matthew_Cook\|name=Matthew Cook}}
	* [https://arxiv.org/abs/0906.3248 A Concrete View of Rule 110 Computation] M Cook - arXiv preprint arXiv:0906.3248, 2009		* [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}}

GUYTU6J: LinkWikipedia

2022-12-16T09:49:49Z

LinkWikipedia

← Older revision		Revision as of 09:49, 16 December 2022
Line 11:		Line 11:

	== External links and further reading==		== External links and further reading==
	* ~~[https://en.wikipedia.org/wiki/~~Cellular_automaton ~~Wikipedia:~~ Cellular automaton]		* {{LinkWikipedia\|Cellular_automaton\|name=Cellular automaton}}
	* [https://arxiv.org/abs/0906.3248 A Concrete View of Rule 110 Computation] M Cook - arXiv preprint arXiv:0906.3248, 2009		* [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}}

Book: added ext link

2022-12-13T19:44:06Z

added ext link

← Older revision		Revision as of 19:44, 13 December 2022
Line 1:		Line 1:
	~~{{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).<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}}

Book: add ref

2022-12-11T20:03:08Z

add ref

← Older revision		Revision as of 20:03, 11 December 2022
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>

Naszvadi: /* External links */ MathGenealogy

2022-11-28T18:26:32Z

External links: MathGenealogy

← Older revision		Revision as of 18:26, 28 November 2022
Line 13:		Line 13:
	== External links ==		== External links ==
	*[https://en.wikipedia.org/wiki/Cellular_automaton Wikipedia: Cellular automaton]		*[https://en.wikipedia.org/wiki/Cellular_automaton Wikipedia: Cellular automaton]
			* {{MathGenealogy\|id=204758\|title=Matthew Cook}}

	{{DEFAULTSORT:Cook, Matthew}}		{{DEFAULTSORT:Cook, Matthew}}

Book: /* External links */

2022-11-26T01:41:10Z

External links

← Older revision		Revision as of 01:41, 26 November 2022
Line 12:		Line 12:

	== External links ==		== External links ==
	*[~~http~~://~~www.~~en.wikipedia.org Wikipedia: Cellular automaton]		*[https://en.wikipedia.org/wiki/Cellular_automaton Wikipedia: Cellular automaton]

	{{DEFAULTSORT:Cook, Matthew}}		{{DEFAULTSORT:Cook, Matthew}}

Book at 19:05, 25 November 2022

2022-11-25T19:05:20Z

← Older revision		Revision as of 19:05, 25 November 2022
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~~, though it was not~~ published ~~until~~ 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).

	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>

Book: Created page with "{{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)}} '''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, though it was not published until 2004. Cook also did pioneering work in 2000 in..."

2022-11-25T19:04:10Z

Created page with "{{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)}} '''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, though it was not published until 2004. Cook also did pioneering work in 2000 in..."

New page

{{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)}}
'''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, though it was not published until 2004.

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>

== See also ==
* [[Unit cell]]

== References ==
<references />

== External links ==
*[http://www.en.wikipedia.org Wikipedia: Cellular automaton]

{{DEFAULTSORT:Cook, Matthew}}