About: Wolfram's 2-state 3-symbol Turing machine

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Wolfram's 2-state 3-symbol Turing machine Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FWolfram%27s_2-state_3-symbol_Turing_machine&invfp=IFP_OFF&sas=SAME_AS_OFF

In his book A New Kind of Science, Stephen Wolfram described a universal 2-state 5-symbol Turing machine, and conjectured that a particular 2-state 3-symbol Turing machine (hereinafter (2,3) Turing machine) might be universal as well.

Attributes	Values
rdf:type	Thing
rdfs:label	Máquina de Turing de 2 estados e 3 símbolos de Wolfram (pt) Wolfram's 2-state 3-symbol Turing machine (en)
rdfs:comment	In his book A New Kind of Science, Stephen Wolfram described a universal 2-state 5-symbol Turing machine, and conjectured that a particular 2-state 3-symbol Turing machine (hereinafter (2,3) Turing machine) might be universal as well. (en) Em seu livro A New Kind of Science, Stephen Wolfram descreveu uma máquina de Turing de cinco cores e dois estados; e conjecturou que uma máquina de Turing particular de dois estados e três cores (de agora em diante, máquina de Turing (2,3)) poderia também ser universal. (pt)
rdfs:seeAlso	Universal Turing machine
foaf:depiction
dcterms:subject	Computer-related introductions in 2002 Turing machine University of Birmingham Wolfram Research
Wikipage page ID	13899858 (xsd:integer)
Wikipage revision ID	1105116695 (xsd:integer)
Link from a Wikipage to another Wikipage	University of Birmingham Vaughan Pratt Computer-related introductions in 2002 Claude Shannon Turing machine Rule 110 Stephen Wolfram Complex Systems (journal) Tag system Linear bounded automaton Alan Turing University of Birmingham Noam Chomsky A New Kind of Science Wolfram Research Martin Davis (mathematician) Marvin Minsky Wolfram Research Turing machine Universal Turing machine Turing completeness New Kind of Science dbr:FOM_mailing_list
Link from a Wikipage to an external page	http://www.thocp.net/biographies/papers/turing_oncomputablenumbers_1936.pdf http://www.nature.com/news/2007/071024/full/news.2007.190.html http://cs.nyu.edu/pipermail/fom/2007-October/012132.html http://cs.nyu.edu/pipermail/fom/2007-October/012156.html https://www.newscientist.com/article/dn12826-simplest-universal-computer-wins-student-25000.html http://www.wolframscience.com/prizes/tm23/ http://www.ddj.com/blog/portal/archives/2007/05/the_prize_and_u.html http://cs.nyu.edu/pipermail/fom/2007-October/012125.html http://cs.nyu.edu/pipermail/fom/2007-October/012149.html http://cs.nyu.edu/pipermail/fom/2007-October/012162.html http://www.wolfram.com/news/researchprize.html http://blog.wired.com/wiredscience/2007/10/college-kid-pro.html http://www.sciam.com/article.cfm%3FchanID=sa003&articleID=D8F2082D-E7F2-99DF-36D4F98C7C2A7674&pageNumber=1&catID=1
sameAs	Wolfram's 2-state 3-symbol Turing machine Wolfram's 2-state 3-symbol Turing machine Wolfram's 2-state 3-symbol Turing machine Wolfram's 2-state 3-symbol Turing machine
dbp:wikiPageUsesTemplate	dbt:Reflist dbt:See_also dbt:Short_description dbt:Use_dmy_dates dbt:Turing
thumbnail	wiki-commons:Special:FilePath/2-state_3-symbol_Turing_Machine.png?width=300
has abstract	In his book A New Kind of Science, Stephen Wolfram described a universal 2-state 5-symbol Turing machine, and conjectured that a particular 2-state 3-symbol Turing machine (hereinafter (2,3) Turing machine) might be universal as well. On May 14, 2007, Wolfram announced a $25,000 prize to be won by the first person to prove or disprove the universality of the (2,3) Turing machine. On 24 October 2007, it was announced that the prize had been won by Alex Smith, a student in electronics and computing at the University of Birmingham, for his proof that it was universal. Since the proof applies to a non-standard Turing machine model which allows infinite, non-periodic initial configurations, it is categorized by some as "weak-universal". (en) Em seu livro A New Kind of Science, Stephen Wolfram descreveu uma máquina de Turing de cinco cores e dois estados; e conjecturou que uma máquina de Turing particular de dois estados e três cores (de agora em diante, máquina de Turing (2,3)) poderia também ser universal. Em 14 de maio de 2007, Wolfram anunciou um prêmio de $25,000 para a primeira pessoa que aprovasse ou desaprovasse a universalidade de uma máquina de Turing (2,3). De acordo com Wolfram, a proposta do prêmio era encorajar a pesquisa para ajudar a responder questões fundamentais associadas com a estrutura do que ele chama de "universo computacional". Em 24 de outubro de 2007, foi anunciado que o prêmio teria sido vencido por Alex Smith, um estudante de computação e eletrônica na Universidade de Birmingham. (pt)
prov:wasDerivedFrom	wikipedia-en:Wolfram's_2-state_3-symbol_Turing_machine?oldid=1105116695&ns=0
page length (characters) of wiki page	15656 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Wolfram's_2-state_3-symbol_Turing_machine
is Link from a Wikipage to another Wikipage of	List of British innovations and discoveries List of English inventions and discoveries A New Kind of Science Universal Turing machine List of things named after Alan Turing 2-3 turing machine Alex Smith (The Simplest Universal Computer Proof contest winner) Alex Smith (mathematician) Wolfram's 2,3 Turing Machine Wolfram 2,3 Turing Machine
is Wikipage redirect of	2-3 turing machine Alex Smith (The Simplest Universal Computer Proof contest winner) Alex Smith (mathematician) Wolfram's 2,3 Turing Machine Wolfram 2,3 Turing Machine
is foaf:primaryTopic of	wikipedia-en:Wolfram's_2-state_3-symbol_Turing_machine

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 60 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software