|
Free Study Guides, Book Notes, Book Reviews & More... |
Pay it forward... Tell others about Novelguide.com |
|---|
| Literary Analysis |  |
| Test Prep Material |  |
|
Reports & Essays | |
|
Global Studyhall | |
|
Teacher Ratings | |
|
Free Cash for College | |
| Novelguide.com Site Search: |
| ||
| Novelguide.com is the premier free source for literary analysis on the web. We provide an educational supplement for better understanding of classic and contemporary Literature Profiles, Metaphor Analysis, Theme Analyses, and Author Biographies. |
THE TURING MACHINEAlan Turing's famous machine is an abstract automaton that can be in any one of a number of states and that is capable of moving back and forth on an infinitely long tape of instructions (customarily zeros and ones), reading and writing instructions on each segment of tape as it moves. A Turing machine's state at a given time is a finite function of both the machine's current state and the information on the currently scanned section of tape. A universal Turing machine is a Turing machine capable of executing any algorithm. |
Copyright © 1999 - Novelguide.com. All Rights Reserved.
To print this page, please use Internet Explorer.
To cite information from this page, please cite the date when you
looked at our site and the author as Novelguide.com.
Copyright Information -- Terms Of Use -- Privacy Statement