Geometry.Net - the online learning center
Home  - Math_Discover - Turing Machine Bookstore
Page 6     101-103 of 103    Back | 1  | 2  | 3  | 4  | 5  | 6 

         Turing Machine:     more books (100)
  1. Connections among space-bounded and multihead probabilistic automata (Technical report / University of Rochester, [Dept. of] Computer Science) by Ioan I Macarie, 1994
  2. Advice from nonadaptive queries to NP (Technical report / University of Rochester, [Dept. of] Computer Science) by Yenjo Han, 1993
  3. A Note on nondeterminism in small, fast parallel computers (Technical report. Pennsylvania State University. Dept. of Computer Science) by Ian Parberry, 1986
  4. Can P and NP manufacture randomness? (Technical report. Cornell University. Department of Computer Science) by Lane A Hemachandra, 1986
  5. Computing in logarithmic space (MAC technical memorandum) by John C Lind, 1974
  6. Relationship among some relativized time complexity classes (Research reports on information sciences) by Masa-aki Izumi, 1985
  7. Discrete computation: Theory and open problems; notes for the lectures (Project MAC) by Albert R Meyer, 1974
  8. The homogenous capture of random strings (Technical report. Cornell University. Department of Computer Science) by B Natarajan, 1985
  9. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Thesis. 1976. M.S by William Joseph Masek, 1976
  10. A counter-example for "a simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars" (Technical ... University. Department of Computer Science) by Jens M Dill, 1987
  11. Unary minimum cost path problems, alternating logspace, and Ruzzo, Simon, and Tompa's DLNL (Technical report. University of Iowa. Dept. of Computer Science) by Rodney R Howell, 1987
  12. Simulation of multiple heads by weak counters (Computer studies publication. University of Hong Kong. Centre of Computer Studies and Applications) by Tat-hung Chan, 1987
  13. The inherent computational complexity of theories of ordered sets: A brief survey (MAC Technical memorandum) by Albert R Meyer, 1974
  14. Average case complete problems ; One-way functions and pseudorandom generators ; Computational complexity of functions (BUCS tech report) by Leonid A Levin, 1985

101. The Alan Turing Home Page
The Alan turing home page The Alan turing home page celebrates the life and work of the mathematician, philosopher and cryptographer, Alan turing (19121954). The author of the site, Andrew Hodges

102. What Is Turing Test? - A Word Definition From The Webopedia Computer Dictionary
to cut through the philosophical debate about how to define thinking, turing devised a subjective test to answer the question, Can machines think? and
You are in the: Small Business Channel Jump to Website ECommerce Guide Small Business Computing Webopedia WinPlanet Enter a word for a definition... ...or choose a computer category. choose one... All Categories Communications Computer Industry Companies Computer Science Data Graphics Hardware Internet and Online Services Mobile Computing Multimedia Networks Open Source Operating Systems Programming Software Standards Types of Computers Wireless Computing World Wide Web Home
Term of the Day

New Terms

New Links
Be a Commerce Partner

Turing test Last modified: Tuesday, February 10, 2004 A test devised by the English mathematician Alan M. Turing to determine whether or not a computer can be said to think like a human brain. In an attempt to cut through the philosophical debate about how to define "thinking," Turing devised a subjective test to answer the question, "Can machines think?" and reasoned that if a computer acts, reacts and interacts like a sentient being, then call it sentient. The test is simple: a human interrogator is isolated and given the task of distinguishing between a human and a computer based on their replies to questions that the interrogator poses. After a series of tests are performed, the interrogator attempts to determine which subject is human and which is an artificial intelligence . The computer's success at thinking can be quantified by its probability of being misidentified as the human subject. E-mail this definition to a colleague
For pages about

103. The Web As A Turing Machine
Sorry! There was an error Can t find a subtable named C\Frontier\Guest Databases\www\discussUserLandRedirect.root . The error$10950
Archive of UserLand's first discussion group, started October 5, 1998.
The web as a Turing Machine
Author: Dave Winer Posted: 9/12/1999; 8:47:24 PM Topic: The web as a Turing Machine Msg #: Prev/Next:
What is a Turing Machine?
In 1936, before the age of computers, Alan Turing, an English mathematician working at Princeton University defined what has come to be known as a "Turing Machine". It's a very simple specification that defines what a computer is. Three simple components, a tape reader, a tape writer, and a processor. The processor reads information from the tape, transforms it, and writes the transformed data to the output tape. Many of today's everyday objects fit the Turing model. A digital cellphone is a Turing Machine its input tape is the keypad, and the output tape is its memory. If your refrigerator, car, bicycle, or stereo has a computer in it, it can be modeled as a Turing Machine. Turing discovered the mathematics of computers, and his model still works, and probably always will work, to simplify the understanding of what we do with computers.
The web as a Turing machine
Now, if so many things are computers, is the web also a computer, according to Turing's mathematics? Well, yes and no. Much of the web is static pages that do not respond to input. Those are not Turing. But more of the web is dynamic, and that part fits the Turing model, and therefore, is just like any other computer you might encounter.

Page 6     101-103 of 103    Back | 1  | 2  | 3  | 4  | 5  | 6 

free hit counter