Wolfram's 2-state 3-symbol Turing machine (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Wolfram's 2-state 3-symbol Turing machine" in English language version.

refsWebsite

Global rank English rank

6nyu.edu

1,174^th place

773^rd place

3doi.org

2^nd place

2wolframscience.com

low place

2nature.com

234^th place

397^th place

2newscientist.com

774^th place

716^th place

1psu.edu

207^th place

136^th place

1complex-systems.com

low place

1wired.com

193^rd place

152^nd place

1bham.ac.uk

6,934^th place

4,192^nd place

1ams.org

451^st place

277^th place

1bbc.co.uk

8^th place

10^th place

1bitwisemag.com

low place

1maa.org

3,479^th place

2,444^th place

1scientificamerican.com

896^th place

674^th place

1maths.org

low place

1theguardian.com

12^th place

11^th place

1ddj.com

low place

1semanticscholar.org

11^th place

8^th place

ams.org

"Math in the news from Math Society". Ams.org. Retrieved 9 March 2010.

bbc.co.uk

news.bbc.co.uk

Crighton, Ben (26 November 2007). "Proving Turing's simple computer". BBC News. Retrieved 9 March 2010.

bham.ac.uk

newscentre.bham.ac.uk

"U of Birmingham". Newscentre.bham.ac.uk. Retrieved 9 March 2010.

bitwisemag.com

"Bitwise Mag article". Bitwise Mag article. 24 October 2007. Retrieved 9 March 2010.

complex-systems.com

"Turing Machines with Two Letters and Two States". Complex Systems. 2010. Retrieved 25 October 2017.

ddj.com

"The Wolfram Prize and Universal Computation: It's Your Problem Now".

doi.org

Brumfiel, Geoff (2007). "Student snags maths prize". Nature. doi:10.1038/news.2007.190. Retrieved 10 February 2009.
Geoff Brumfiel (24 October 2007). "Nature.com". Nature. Nature.com. doi:10.1038/news.2007.190. Retrieved 9 March 2010.
Smith, Alex (2020). "Universality of Wolfram's 2, 3 Turing Machine". Complex Systems. 29 (1): 1–44. doi:10.25088/ComplexSystems.29.1.1. S2CID 17142621.

maa.org

"Mathematical Association of America". Maa.org. Retrieved 9 March 2010.

maths.org

plus.maths.org

"plus magazine". Plus.maths.org. 8 November 2007. Retrieved 9 March 2010.

nature.com

Brumfiel, Geoff (2007). "Student snags maths prize". Nature. doi:10.1038/news.2007.190. Retrieved 10 February 2009.
Geoff Brumfiel (24 October 2007). "Nature.com". Nature. Nature.com. doi:10.1038/news.2007.190. Retrieved 9 March 2010.

newscientist.com

"New Scientist". New Scientist. Retrieved 9 March 2010.
"Simplest 'universal computer' wins student $25,000". New Scientist. 24 October 2007. Retrieved 28 January 2016.

nyu.edu

cs.nyu.edu

"Stephen Wolfram reply in the FOM list". New York University. October 2007.
"[FOM] Smallest universal machine". Cs.nyu.edu. 30 October 2007. Retrieved 18 August 2022.
"[FOM] Smallest universal machine". Cs.nyu.edu. 26 October 2007. Retrieved 18 August 2022.
"Vaughan Pratt's message to the FOM list". 29 October 2007.
"Alex Smith's first reply to Vaughan Pratt in the FOM list". 30 October 2007.
"FOM list archive for November 2007". Cs.nyu.edu. Retrieved 9 March 2010.

psu.edu

citeseerx.ist.psu.edu

Goodman-Strauss, Chaim, Can't decide? Undecide!, CiteSeerX 10.1.1.164.306, retrieved 4 February 2022

scientificamerican.com

Minkel, J. R. (25 October 2007). "A New Kind of Science Author Pays Brainy Undergrad $25,000 for Identifying Simplest Computer". Scientific American. Retrieved 9 March 2010.

semanticscholar.org

api.semanticscholar.org

Smith, Alex (2020). "Universality of Wolfram's 2, 3 Turing Machine". Complex Systems. 29 (1): 1–44. doi:10.25088/ComplexSystems.29.1.1. S2CID 17142621.

theguardian.com

Stuart, Tom (29 November 2007). "Complex proof of a very simple computer". The Guardian. London. Retrieved 9 March 2010.

wired.com

blog.wired.com

Keim, Brandon (24 October 2007). "College Kid Proves That Wolfram's Turing Machine is the Simplest Universal Computer". Wired. Retrieved 10 February 2009.

wolframscience.com

Wolfram, Stephen (2002). A New Kind of Science. p. 709. Retrieved 10 February 2009.
"The Wolfram 2,3 Turing Machine Research Prize". Retrieved 10 February 2009.