The Tinkertoy Computer and Other Machinations

by A.K. Dewdney

Book Overview

From a distance the Tinkertoy computer resembles a childhood fantasy gone wild or, as one of the group members remarked, a spool-and-stick version of the 'space slab' from the movie 2001: A Space... This description may be from another edition of this product.

• Format: Paperback
• Language: English
• ISBN: 071672491X
• ISBN13: 9780716724919
• Release Date: January 1993
• Publisher: W.H. Freeman & Company
• Length: 238 Pages
• Weight: 0.85 lbs.
• Dimensions: 0.7" x 6.1" x 9.2"

Customer Reviews

Curious Book

This book is ideal for anyone who likes to tinker with computers and/or is into programming, electroincs, math, or physics. It is a composition of mental explorations which range from building a computer out of tinkertoys to chaos theory, computer-generated music, and fractal geometry. Most chapters are easy reads, but a couple get a little dry. Overall it was a very enjoyable, thought-provoking book.

Yes, you can compute using tinkertoys!

The master machinator is at it again, explaining computer science in ways that are offbeat, understandable and exciting. Yes, it is true that a functional computer was built by students at M. I. T. using Tinkertoys, and it played a mean game of tic-tac-toe. While fun to think about and look at, this idea contains much that is deeply significant. As those exposed to Turing Machines know, located in chapter six of this book and found in Dewdney's other works, computer computations are built using very simple base models. There is no theoretical distinction between the actions of a Tinkertoy computer and the fastest supercomputer. The ultimate capabilities of computers, if such things really exist, are not a function of the complexity of the base operations. Which leads to the discussion of a heated debate taking place in and around the Artificial Intelligence (AI) community. Arguers against the notion of true machine intelligence use the underlying simplicity of computer computations to refute the idea that machines can ever develop self-awareness. Which is now becoming the irrefutable proof of true AI, supplanting the Turing test. Dewdney handles this philosophical discussion very well, posing his own questions. Such as, will we ever truly know what thinking really is? Chaotic music, neural networks, programming Star Trek and golf games; computers that "passed" the Turing test and computer sculptures are just some of the additional material covered. The number of ways Dewdney finds to further explain computer science is nothing short of amazing. Another in a growing list of superb primers in computer science by this author, one can only hope that they keep coming. Each essay is a jewel to be treasured and pondered. Published in Journal of Recreational Mathematics, reprinted with permission.