About: Turing Tumble

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

About: Turing Tumble Goto Sponge NotDistinct Permalink

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

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FTuring_Tumble

Turing Tumble is a game and demonstration of logic gates via mechanical computer. Named after Alan Turing, the game itself can (abstractly) duplicate the processes of any computer whatsoever if the game field itself were sufficiently large. This follows because the game is P-complete by the circuit value problem and PSPACE-complete if an exponential number of marbles are allowed. The device has implications for nanotechnology.

Attributes	Values
rdfs:label	Turing Tumble (en)
rdfs:comment	Turing Tumble is a game and demonstration of logic gates via mechanical computer. Named after Alan Turing, the game itself can (abstractly) duplicate the processes of any computer whatsoever if the game field itself were sufficiently large. This follows because the game is P-complete by the circuit value problem and PSPACE-complete if an exponential number of marbles are allowed. The device has implications for nanotechnology. (en)
dcterms:subject	Mechanical computers Educational toys
Wikipage page ID	62552105 (xsd:integer)
Wikipage revision ID	1091942590 (xsd:integer)
Link from a Wikipage to another Wikipage	American Specialty Toy Retailing Association University of Minnesota Nanotechnology PSPACE-complete Mechanical computers Rule 110 Logic Comic book Computer programming Turing complete Mechanical computer Game Gamification P-complete Aesthetic Alan Turing DIY Pachinko Parents' Choice Award Digi-Comp II Framing device Logic gate Puzzle Educational toys Texas Instruments Cellular automata Circuit value problem Maker culture Turing machines
Link from a Wikipage to an external page	https://jessecrossen.github.io/ttsim https://www.turingtumble.com
sameAs	Turing Tumble Turing Tumble
dbp:wikiPageUsesTemplate	dbt:Portal dbt:Reflist dbt:Use_dmy_dates
cs1-dates	y (en)
date	July 2020 (en)
has abstract	Turing Tumble is a game and demonstration of logic gates via mechanical computer. Named after Alan Turing, the game itself can (abstractly) duplicate the processes of any computer whatsoever if the game field itself were sufficiently large. This follows because the game is P-complete by the circuit value problem and PSPACE-complete if an exponential number of marbles are allowed. The device has implications for nanotechnology. The game is advertised as Turing complete; an extension of the game that allows an infinitely large board and infinitely many pieces has been shown to be Turing complete via simulations of both Rule 110 for cellular automata, as well as of Turing machines. Although it resembles a pachinko machine in its aesthetic use of gravity-fed metal balls, it is primarily a teaching device in the fundamentals of logic-computer programming, and as such is an example of gamification. The framing device in the included comic book features an astronaut who must solve sixty increasingly difficult logic problems which illustrate the fundamentals of computer programming. The impetus of the puzzle itself was the frustration of the programmer and chemistry professor Paul Boswell (along with his wife, Alyssa Boswell, a DIY maker), then at the University of Minnesota, at the lack of computing prowess of other scientists which was necessary for their own projects; he was already well known for programming complex games for Texas Instruments computers. They were also inspired by the Digi-Comp II, a precursor from the late 1960s. (en)
prov:wasDerivedFrom	wikipedia-en:Turing_Tumble?oldid=1091942590&ns=0
page length (characters) of wiki page	8061 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Turing_Tumble
is Link from a Wikipage to another Wikipage of	Nim PSPACE-complete Mechanical computer Digi-Comp I Digi-Comp II WDR paper computer
is foaf:primaryTopic of	wikipedia-en:Turing_Tumble

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 (61 GB total memory, 51 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software