81. Turing The turing machine could write a symbol on the tape, or delete a symbol from the It is impossible to decide (using another turing machine) whether a http://www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Turing.html

Alan Mathison Turing Born: 23 June 1912 in London, England Died: 7 June 1954 in Wilmslow, Cheshire, England Click the picture above to see two larger pictures Show birthplace location Previous (Chronologically) Next Biographies Index Previous (Alphabetically) Next Main index Version for printing Alan Turing was born at Paddington, London. His father, Julius Mathison Turing, was a British member of the Indian Civil Service and he was often abroad. Alan's mother, Ethel Sara Stoney, was the daughter of the chief engineer of the Madras railways and Alan's parents had met and married in India. When Alan was about one year old his mother rejoined her husband in India, leaving Alan in England with friends of the family. Alan was sent to school but did not seem to be obtaining any benefit so he was removed from the school after a few months. Next he was sent to Hazlehurst Preparatory School where he seemed to be an 'average to good' pupil in most subjects but was greatly taken up with following his own ideas. He became interested in chess while at this school and he also joined the debating society. He completed his Common Entrance Examination in 1926 and then went to Sherborne School. Now 1926 was the year of the general strike and when the strike was in progress Turing cycled 60 miles to the school from his home, not too demanding a task for Turing who later was to become a fine athlete of almost Olympic standard. He found it very difficult to fit into what was expected at this public school, yet his mother had been so determined that he should have a public school education. Many of the most original thinkers have found conventional schooling an almost incomprehensible process and this seems to have been the case for Turing. His genius drove him in his own directions rather than those required by his teachers.

82. Boing Boing: Lego Turing Machine This person built a turing machine out of Lego, and has posted extensive buildnotes. Well, this turing machine is not entirely mechanical. http://www.boingboing.net/2005/07/14/lego_turing_machine.html

@import url(http://www.boingboing.net/table.css); suggest a site rss archives store ... john Sponsored by: HOWTO: Get a link posted to Boing Boing Boing Boing Mobile powered by Winksite Fark rules! Our Linking Policy This work is licensed under a Creative Commons License Stats (About our stats) Our first five years' worth of posts in one file Thursday, July 14, 2005 Lego Turing Machine This person built a Turing Machine out of Lego, and has posted extensive build-notes. Well, this Turing machine is not entirely mechanical... I used the RCX to store the transition table. Since the symbols are bar codes read with a light detector, it would have been very difficult to continue with a physical mechanism. Three subroutines are required, one to select which symbol to provide on top of the memory, one to turn the provider one quarter of a turn, and one to pull out one symbol from the bottom of the memory (reading it on the way). Link Thanks, Brad posted by Cory Doctorow at 12:43:49 AM permalink Other blogs commenting on this post Sponsored by: //1) Call function randomorder(arrayname, space_between_content) randomorder(content, '')

83. Turing Machine Definition of turing machine, possibly with links to more information and implementations. http://www.nist.gov/dads/HTML/turingMachine.html

Turing machine (definition) Definition: A model of computation consisting of a finite state machine controller, a read-write head, and an unbounded sequential tape. Depending on the current state and symbol read on the tape, the machine can change its state and move the head to the left or right. Unless otherwise specified, a Turing machine is deterministic See also other models: cell probe model random access machine pointer machine multiprocessor model , related terms: big-O notation busy beaver , variants: alternating Turing machine nondeterministic Turing machine oracle Turing machine probabilistic Turing machine ... universal Turing machine Author: CRC-A More information An article in the Stanford Encyclopedia of Philosophy. Go to the Dictionary of Algorithms and Data Structures home page. If you have suggestions, corrections, or comments, please get in touch with Paul E. Black (paul.black@nist.gov). Entry modified Fri Dec 17 11:55:21 2004. HTML page formatted Wed Aug 24 11:23:39 2005. Cite this as: Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "Turing machine", from Dictionary of Algorithms and Data Structures , Paul E. Black, ed.

84. Oracle Turing Machine Definition of oracle turing machine, possibly with links to more information and implementations. http://www.nist.gov/dads/HTML/oracleTur.html

oracle Turing machine (definition) Definition: A Turing machine with an extra oracle tape and three extra states q , q y , q n . When the machine enters q , control goes to state q y if the oracle tape content is in the oracle set ; otherwise control goes to state q n See also alternating Turing machine nondeterministic Turing machine probabilistic Turing machine universal Turing machine Author: CRC-A Go to the Dictionary of Algorithms and Data Structures home page. If you have suggestions, corrections, or comments, please get in touch with Paul E. Black (paul.black@nist.gov). Entry modified Fri Dec 17 12:06:05 2004. HTML page formatted Wed Aug 24 11:23:19 2005. Cite this as: Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "oracle Turing machine", from Dictionary of Algorithms and Data Structures , Paul E. Black, ed., NIST http://www.nist.gov/dads/HTML/oracleTur.html

85. The Myth Of The Turing Machine Since its invention in the late thirties, the turing machine has heavily influenced The turing machine often plays a central role in debates about the http://watarts.uwaterloo.ca/~celiasmi/Papers/Turing Myth.central.jetai.1ce.nofie

The Myth of the Turing Machine The Failings of Functionalism and Related Theses February, 2002 Submitted to JETAI Chris Eliasmith Dept. of Philosophy University of Waterloo eliasmith@uwaterloo.ca Abstract The properties of Turing’s famous ‘universal machine’ has long sustained functionalist intuitions about the nature of cognition. Here, I show that there is a logical problem with standard functionalist arguments for multiple realizability. These arguments rely essentially on Turing’s powerful insights regarding computation. In addressing a possible reply to this criticism, I further argue that functionalism is not a useful approach for understanding what it is to have a mind. In particular, I show that the difficulties involved in distinguishing implementation from function make multiple realizability claims untestable and uninformative. As a result, I conclude that the role of Turing machines in philosophy of mind needs to be reconsidered. The Myth of the Turing Machine The Failings of Functionalism and Related Theses 1. Introduction

86. Turing Machine http://www.theatrefeuilleton2.net/np3turi/turing.htm

87. Turing Machine A turing machine can be thought of as a black box that carries out a calculation A turing machine that can simulate any other turing machine is called a http://www.daviddarling.info/encyclopedia/T/Turing_machine.html

Return to The Worlds of David Darling INDEX LATEST NEWS ARCHIVE ... Z entire Web this site Turing machine An abstract model of computer execution and storage introduced in 1936 by Alan Turing to give a mathematically precise definition of algorithm . A Turing machine can be thought of as a black box that carries out a calculation of some kind on an input number. If the calculation reaches a conclusion, or halts, then an output number is returned. Otherwise, the machine theoretically carries on forever. There are an infinite number of Turing machines, as there are an infinite number of calculations that can be done with a finite list of rules. A Turing machine that can simulate any other Turing machine is called a universal Turing machine . The concept of Turing machines is still widely used in theoretical computer science, especially in complexity theory and the theory of computation.

88. Untitled Document The Universal turing machine Anthology. 327347) (Yet while he makes this move, Brosl Hasslacher argues in the article “Beyond the turing machine” (The http://www.english.ucsb.edu/grad/student-pages/jdouglass/coursework/hyperliterat

The Desk Coursework Hyperliterature Machine Writing and the Turing Test From writing to writing system, in accordance with a queer theory of identity and a reception theory of art by Jeremy Douglass jdouglas@umail.ucsb.edu http://transcriptions.english.ucsb.edu/courses/liu/english236HL/index.html ayliu@humanitas.ucsb.edu http://english.ucsb.edu/ Fall 2001 Contents: Text and Test Machine Writing The Turing Test Will Machine Writings ‘Pass’? ... Further Work Text and Test Machine Writing Machine writings are texts produced mechanically in accordance with some composition strategy. These texts need not be in a traditional literary form, although for the purposes of this discussion they will be assumed to be in a common style familiar to a human reader, such as a monologue, poem, letter, short story etc. The machine itself need not be a computer – although as with many large and complicated problems of the past century, the computer is currently the only machine capable of manipulating the rules and components of language in anything approaching the complexity used by human writer. The Turing Test Mathematician Alan Turing (1912-1954) outlined the Turing Test, or “imitation game,” in an article

89. Turing Machine Simulator ANOTHER turing machine SIMULATOR, IMPLEMENTED AS A JAVA(tm) APPLICATION Figure 12 shows the turing machine simulator with several tapes and tracks. http://www.cs.binghamton.edu/~software/tm/tmdoc.html

ANOTHER TURING MACHINE SIMULATOR, IMPLEMENTED AS A JAVA(tm) APPLICATION Version 1.2 (November 1, 1997) (tm) Java is a registered trademark of Sun Microsystems This is a simulator for deterministic Turing machines, following the style in J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979. A simulator for non-deterministic Turing machines is being planned and will appear after the next project, which is a simulator for a non-deterministic push-down automaton. Please note that there is also a finite-state machine simulator available Contents: Obtaining the Java interpreter Obtaining the Turing machine simulator Setting the environment Obtaining the example files ... Example 4 Obtaining the Java interpreter Be prepared for several hours download time (try overnight). If you plan to develop programs in Java, download the "api documentation" and unzip it using a 32-bit (long file name) unzipper Obtaining the Turing machine simulator No file copying is necessary if you are working locally and using our server bingsuns. For your own PC, download the file

90. Punknews.org | Turing Machine - Zwei Tours, News and Reviews about Punk, Emo and Hardcore. http://www.punknews.org/reviews.php?op=albumreview&id=4215

91. Link Right 2 » Blog Archive » Turing Machine turing machine. July 12th, 2005 1443 by Anton. turing machine. Cool LEGO creation. Although it is composed of pretty simple capabilities, Turing argued http://lr2.com/archives/2005/07/12/turing-machine/

Link Right 2 Ebbers sentenced to 25 years in prison Turing machine July 12th, 2005 14:43 by Anton Turing machine Cool LEGO creation. Although it is composed of pretty simple capabilities, Turing argued that this simple machine could performed any computation, that is, could realize anything that results from operations. In 1950, he discussed that the mind is itself the results of operations (at the neural level) and thus is the creator of the artificial intelligence studies. Web lr2.com This entry was posted on Tuesday, July 12th, 2005 at 2:43 pm and is filed under Computers LEGO . You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response , or trackback from your own site. Leave a Reply Name Mail (will not be published) Website Link Right 2 is proudly powered by WordPress Entries (RSS) and Comments (RSS)

92. Turing Machines A turing machine has a twoway infinite tape, made of cells. Below, you can see the initial configuration of a turing machine on the input 101001 http://www.logique.jussieu.fr/~michel/tmi.html

Turing machines: an Introduction Contents What is a Turing machine? What is a busy beaver? What are busy beavers used for? Last update: March 2005 What is a Turing machine? A Turing machine has a two-way infinite tape, made of cells. In each cell, there is a symbol There is a finite number of symbols, denoted by 0, 1, ... The symbol is the blank symbol Initially, the Turing machine holds a finite input This input is a string of symbols, for example: 101001. The other cells of the tape hold blank symbols. In the kind of machine we consider, the input can contain the blank symbol 0. A Turing machine has a tape head. With this tape head, the machine can read and write on the tape. The tape head moves one cell left or right at each step. These directions are denoted by L and R In the kind of machine we consider, the tape head cannot keep still. Initially, the tape head scans the leftmost symbol of the input. A Turing machine has a finite number of states The states are denoted by A, B, C, ... In addition to these states, there is a special state, the

93. PlanetMath: Deterministic Turing Machine The formal definition of a deterministic turing machine is a tuple A turing machine is conceived to be a box with a tape and a tape head. http://planetmath.org/encyclopedia/DeterministicTuringMachine.html

(more info) Math for the people, by the people. Encyclopedia Requests Forums Docs ... Random Login create new user name: pass: forget your password? Main Menu sections Encyclop¦dia Papers Books Expositions meta Requests Orphanage Unclass'd Unproven ... Classification talkback Polls Forums Feedback Bug Reports downloads Snapshots PM Book information News Docs Wiki ChangeLog ... About deterministic Turing machine (Definition) The formal definition of a deterministic Turing machine is a tuple Where is a finite set of states is the finite set of tape symbols, is the blank symbol, is the set of input symbols, is the move function is the start state and is the set of final states. A Turing machine is conceived to be a box with a tape and a tape head. The tape consists of an infinite number of cells stretching in both directions, with the tape head always located over exactly one of these cells. Each cell has symbol from written on it. At the beginning of its computation, is in state and a finite string (the input string) over the alphabet is written on the tape, with the tape located over the first letter of

94. Is The Brain Equivalent To A Turing Machine? || Kuro5hin.org I d have to say that the brain is not any kind of turing machine. The brain is not a turing machine by delmoi, 03/18/2003 121824 AM EST (3.00 / 1) http://www.kuro5hin.org/story/2003/3/15/15956/6995

create account help/FAQ contact links ... MLP We need your support: buy an ad premium membership k5 store Is the Brain Equivalent to a Turing Machine? ... Technology By Mon Mar 17th, 2003 at 02:00:56 PM EST From the NewScientist.com: "The world's first brain prosthesis - an artificial hippocampus - is about to be tested in California. Unlike devices like cochlear implants, which merely stimulate brain activity, this silicon chip implant will perform the same processes as the damaged part of the brain it is replacing. The prosthesis will first be tested on tissue from rats' brains, and then on live animals. If all goes well, it will then be tested as a way to help people who have suffered brain damage due to stroke, epilepsy or Alzheimer's disease." This brings up the key question that this article will focus on - Is the Brain a Turing Complete Machine? Description of a Turing Machine Alan Turing was a mathematician and logician in 20th century. He is often considered the pioneer of computer science as we know it today. He helped the British Government crack German codes during World War II. His world-changing contribution to society was a Turing Machine. For a history about Alan Turing, the man, see:

95. [math/0209332] Hypercomputation: Computing More Than The Turing Machine Hypercomputation computing more than the turing machine. Authors Toby Ord Comments 57 pages, 9 figures Subjclass Logic; Other http://arxiv.org/abs/math.LO/0209332

Mathematics, abstract math.LO/0209332 From: Toby Ord [ view email ] Date: Wed, 25 Sep 2002 18:07:00 GMT (764kb) Hypercomputation: computing more than the Turing machine Authors: Toby Ord Comments: 57 pages, 9 figures Subj-class: Logic; Other MSC-class: 03D10 (Primary) 68Q10, 68Q10, 68Q30 (Secondary) Due to common misconceptions about the Church-Turing thesis, it has been widely assumed that the Turing machine provides an upper bound on what is computable. This is not so. The new field of hypercomputation studies models of computation that can compute more than the Turing machine and addresses their implications. In this report, I survey much of the work that has been done on hypercomputation, explaining how such non-classical models fit into the classical theory of computation and comparing their relative powers. I also examine the physical requirements for such machines to be constructible and the kinds of hypercomputation that may be possible within the universe. Finally, I show how the possibility of hypercomputation weakens the impact of Godel's Incompleteness Theorem and Chaitin's discovery of 'randomness' within arithmetic. Full-text: PDF only References and citations for this submission: CiteBase (autonomous citation navigation and analysis) Which authors of this paper are endorsers?

96. Turing Machines And Computability Such abstract computing machines are now called turing machines . A turing machine (TM) consists of a control unit and a read/write head positioned http://www.augustana.ab.ca/~mohrj/courses/1998.fall/csc110/lecture_notes/turing_

COMPUTING SCIENCE 110 Introduction to Computing Science Turing Machines and Computability Computing Machines and Algorithms An algorithm is a computational process that takes a problem instance and in a finite amount of time produces a solution. . . . It is hard to make the definition of algorithm more precise except by saying that a computational process is anything that can be done by a program for a computing machine, and in that case one must accept that a human being with paper and pencil is a kind of computing machine. (Floyd and Beigel, The Language of Machines , Computer Science Press, W.H. Freeman, 1994, p. 444.) Computability and Decidability Problems which are intended to be solved by a computational process may be stated in a variety of ways: Decision Problems A decision problem is stated as a question with a "yes" or "no" answer, such as: Is the number 23171 prime? Does 2005 January 1 fall on a Friday? Is the list of names in the file ' clients.txt ' in sorted order? Does she love me? If the problem is stated as a Boolean statement - an assertion which is either true or false - we call the statement a predicate If there is an effective procedure for answering the question or evaluating the assertion, we say that the problem is

97. Visual Turing: A Graphical IDE For Turing Machines Visual Turing is a graphical IDE that you may use to edit and debug with turing machines. http://www.cheransoft.com/vturing/

Visual Turing is a graphical IDE that you may use to edit and play with Turing machines. This software is freeware but you may buy the source code for $39 to see how it was written or to use parts of it in your projects. Books on Turing Machines . Here are my recommendations on some books from Amazon.com related to this topic Introduction to the Theory of Computation by Michael Sipser. "Intended as an upper-level undergraduate or introductory graduate text in computer science theory," this book lucidly covers the key concepts and theorems of the theory of computation. Turing and the Computer (The Big Idea) .Turing and the Computer offers an encapsulation of the groundwork that led to the invention of the computer as we know it and an absorbing account of the man who helped develop it More books that I recommend...

98. The Turing Machine (from Computer) --  Encyclopædia Britannica The turing machine (from computer) Alan Turing, while a mathematics student at the University of Cambridge, was inspired by German mathematician David http://www.britannica.com/eb/article-216036

Home Browse Newsletters Store ... Subscribe Already a member? Log in Content Related to this Topic This Article's Table of Contents Expand all Collapse all Introduction Computing basics ... Molecular computing Operating systems Role of operating systems Modern types of operating systems Multiuser systems Thin systems Reactive systems Operating system design approaches ... History of computing Early history Computer precursors The abacus Analog calculators: from Napier's logarithms to the slide rule Digital calculators: from the Calculating Clock to the Arithmometer The Jacquard loom ... Other early business machine companies Invention of the modern computer Early experiments Vannevar Bush's Differential Analyzer Howard Aiken's digital calculators changeTocNode('toc216032','img216032'); The Turing machine Pioneering work The Atanasoff-Berry Computer The first computer network Konrad Zuse Developments during World War II Colossus The Z4 ENIAC Toward the classical computer Bigger brains The first stored-program machines Whirlwind UNIVAC ... The age of Big Iron Programming languages Early computer language development Machine language Zuse's Plankalkül Interpreters Compilers FORTRAN, COBOL, and ALGOL

99. Cover Pages: Turing Machine Markup Language (TMML). I created TMML and the Universal turing machine stylesheet to have some TMML was designed to be a superset of these various turing machine definitions. http://xml.coverpages.org/ni2001-03-19-b.html

SEARCH ABOUT INDEX NEWS ... LIBRARY SEARCH Advanced Search ABOUT Site Map CP RSS Channel ... Historic Created: March 19, 2001. News: Cover Stories Turing Machine Markup Language (TMML). Robert C. Lyons of Unidex Inc. has created an XML-based Turing Machine Markup Language (TMML) for describing Turing machines. "Just for fun," he says in the XML-DEV announcement... "I created TMML and the Universal Turing Machine stylesheet to have some fun and to learn more about the XSLT language; I designed this site to share what I learned about Turing machines and XSLT. A language is Turing complete if it is powerful enough to implement any Turing machine. It is widely believed that Turing machines are powerful enough to perform any calculation that can be performed by a modern computer program." Lyons' TMML web site "provides sample TMML documents and an XSLT 1.0 stylesheet that interprets ( i.e. , executes) the Turing machine that is described in a TMML document. This XSLT stylesheet, which is a Universal Turning Machine, is an existence proof that XSLT 1.0 is Turing complete. The stylesheet, which is available in HTML format and as an XSLT document, has been run with SAXON and Xalan. It does not use any extension functions or proprietary features. The stylesheet does use the xsl:key instruction and the XPath function."

100. TP: The Paranoid Machine The turing machine follows classical mechanical (hierarchic) logic it The turing machine is program driven the representations it writes on its http://www.heise.de/tp/r4/artikel/19/19187/1.html

heise online c't iX Technology Review ... DER UNTERGANG Die letzten Tage im Kanzlerbunker (I). Nach der Verabschiedung von Hartz VIII sind in der Bundesrepublik schwere Unruhen ausgebrochen. Eine Zukunftsgeschichte aus dem Jahre 2007. The Paranoid Machine Peter Krieg Computing Beyond Turing 70 years ago (1935), Alan Turing started his studies of mathematical logic and formulated the initial parts of a theory, that would become - as "Turing Machine - the foundation of our computers until this very day. Turing compared his universal calculating machine to a human who calculated a number, and restricted its principal application to "those problems which can be solved by human clerical labour, working to fixed rules, and without understanding". This restriction, however, could not prevent computer scientists to soon promise an intelligent electronic brain which could simulate the entire spectrum of human thinking and thus eventually could replace man himself. (Marvin Minsky, Hans Moravec, Ray Kurzweil, Bill Joy et al.) After 70 years of computer research and around 50 years of futile efforts to create "artificial intelligence" we still are confronted with the question why the Turing machine seems neither capable of learning and adapting nor of mapping and simulating complex systems - and whether there could be computing beyond the Turing machine...

Page 5     81-100 of 111    Back | 1  | 2  | 3  | 4  | 5  | 6  | Next 20