Turing Tumble

Add links
From Wikipedia, the free encyclopedia
A beginner's Turing Tumble layout

Turing Tumble is a game and demonstration of logic gates via mechanical computing.

Description[edit]

Named after Alan Turing, the game could, in the abstract, 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 is allowed.[1][2] The device has implications for nanotechnology.[3][4]

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.[5][6]

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 60 increasingly difficult logic problems which illustrate the fundamentals of computer programming.

History[edit]

The impetus of the puzzles included with the device 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. Boswell was already well known for programming complex games for Texas Instruments computers. The inventors were also inspired by the Digi-Comp II, a precursor from the late 1960s.[7]

Components[edit]

A Turing Tumble machine has the following parts:

  • Ball drops – The standard version uses two ramps which store a given number of balls. A switch at the bottom of the board triggers the release of the initial ball (typically blue), from the top left of the panel. The second ramp, on the right, contains red balls.
  • Ramps and crossovers – The green ramp allows the balls to run down it one way and release it in only that direction, whereas the orange crossover lets balls traverse it to either side both ways, i.e. from right to left and vice versa.
  • Interceptors – This black piece stops a ball.
  • Bits – This is a one-bit storage: it changes direction when a ball rolls through, such that the next ball goes to the other side.
  • Gear and gear bits – Gear bits are exactly like regular bits, but they can be connected to gears. The gears allow for linking state changes, thus integrally adding extra (abstract) power.

Reception[edit]

Critically, the device has received high praise for its concept and execution,[8] albeit with some caveats (the recommended age being 8+).[9]

The computing game has won the Parents' Choice Gold Award,[10] and won in the category "Best Toys of the Year 2018" under the aegis of the American Specialty Toy Retailing Association.[11]

References[edit]

  1. ^ Johnson, Matthew (April 2019). "Turing Tumble is P(SPACE)-Complete". Algorithms and Complexity. Lecture Notes in Computer Science. Vol. 11485. pp. 274–285. doi:10.1007/978-3-030-17402-6_23. ISBN 978-3-030-17401-9. S2CID 159042415.
  2. ^ Hoover, H. James (2019-05-26). "Turing Tumble is P-Complete". sites.ualberta.ca. Archived from the original on 2020-07-27.
  3. ^ Tomita, Takahiro (20–22 June 2018). "Constructing Reversible Logic Elements on Turing Tumble Model" (PDF). Proceedings of Automata 2018: 25–32. Archived (PDF) from the original on 2020-05-06. Retrieved 2019-12-10. (NB. A longer version was published in 2019.)
  4. ^ Tomita, Takahiro; Lee, Jia; Isokawa, Teijiro; Peper, Ferdinand; Yumoto, Takayuki; Kamiura, Naotake (2019-09-03). "Universal logic elements constructed on the Turing Tumble". Natural Computing. 19 (9). Springer-Verlag: 787–795. doi:10.1007/s11047-019-09760-8. eISSN 1572-9796. ISSN 1567-7818. S2CID 201714072. Archived from the original on 2020-07-27. Retrieved 2020-07-27. (NB. A short version of this paper was presented at AUTOMATA 2018.)
  5. ^ Pitt, Lenny (2023-02-28). "Turing Tumble is Turing-Complete". Theoretical Computer Science. 948: 113734. arXiv:2110.09343. doi:10.1016/j.tcs.2023.113734. S2CID 239016461.
  6. ^ "Proof of Turing Completeness?". Turing Tumble Community Bboard. 2018-07-17.
  7. ^ Frauenfelder, Mark (2017-04-30). "Cool marble-powered mechanical computer to solve logic problems". BoingBoing. Archived from the original on 2020-07-27. Retrieved 2019-12-10.
  8. ^ Hall, Stephen (2018-12-05). "Review: Turing Tumble". Geeks Under Grace. Archived from the original on 2019-12-02. Retrieved 2019-12-10.
  9. ^ "Turing Tumble: A Timberdoodle Review". MamaBeanAz. 2019-09-15. Archived from the original on 2020-07-27. Retrieved 2019-12-10.
  10. ^ "Turing Tumble: Build Marble Powered Computers". Parents Choice Foundation.
  11. ^ "AMERICAN SPECIALTY TOY RETAILING ASSOCIATION ANNOUNCES 2018 BEST TOYS FOR KIDS AWARD WINNERS" (PDF). 2018-07-13.

External links[edit]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Turing_Tumble&oldid=1211226695"