101. How Arbitrary Is The Representation Of A Turing Machine? - Stack Overflow I know a turing machine is formally defined as a 7tuple. If I have a Turing Machine U and another Turing Machine M , is it trivial to design U to recognize http://stackoverflow.com/questions/4037034/how-arbitrary-is-the-representation-o

102. Id:A060843 - OEIS Search Results Shen Lin and T. Rado, Computer Studies of Turing Machine Problems, Claude E. Shannon, A universal Turing machine with two internal states, http://www.research.att.com/njas/sequences/A060843

Greetings from The On-Line Encyclopedia of Integer Sequences Hints Search: id:A060843 Displaying 1-1 of 1 results found. page 1 short internal text references ... off Busy Beaver Problem: a(n) = maximal number of steps that an n-state Turing machine can make on an initially blank tape before eventually halting. list graph listen OFFSET COMMENT "In 1965 Tibor Rado, together with Shen Lin, proved that a(3) is 21. ... Next, in 1983, Allan Brady proved that a(4) is 107. ... Then in 1989 Heiner Marxen and Juergen Buntrock discovered that a(5) is at least 47176870. ... As for a(6), Marxen and Buntrock set another record in 1997 by proving that it is at least 8690333381690951." [Based on Aaronson's web page.] The function Sigma(n) ( ) denotes the maximal number of tape marks which a Turing Machine with n internal states and a two-way infinite tape can write on an initially empty tape and then halt. The function a(n) (the present sequence) denotes the maximal number of steps (shifts) which such a machine can make (it needs not produce many tape marks). Given that 5-state machines can compute Collatz-like congruential functions (see references), it may be very hard to find the next term.

103. Alan Turing Jump to Turing Machine A Turing Machine was a specific mechanical device that could carry out some specific task in a systematic way. http://www.computer50.org/mark1/turing.html

Mark 1 Story : Introduction The Baby Manchester Mark 1 Ferranti Mark 1 Current Page : Turing Machine Turing at Princeton Enigma v. Bombe Mark 1 ... End of Page (Links) Alan M. Turing (1912 - 1954) Alan Mathison Turing was born on June 23rd 1912 in Paddington, London. He was educated at Sherborne School, and then went to King's College, Cambridge in 1931 to read Mathematics. Alan Turing was a brilliant original thinker. Formally a mathematician, in his lifetime he studied and wrote papers over a whole spectrum of subjects, from philosophy and psychology through to physics, chemistry and biology. He was probably at his happiest when he could combine high-level thinking with hands-on experience with machinery or experiments. In addition to his many other interests, for most of his postgraduate life he probably had a deeper understanding of computers and their potential in the future than anyone else. For the full story of Turing's life, visit the Turing Web Site , from which much of this description is derived. The Turing Machine (1934-36) Turing graduated from Cambridge in Mathematics in 1934, and was a fellow at Kings for two years, during which he wrote his now famous paper published in 1937 "

104. Stottler Henke - Artificial Intelligence History 1937, Alan Turing conceived of a universal Turing machine that could mimic the operation of any other computing machine. However, as did Godel, http://www.stottlerhenke.com/ai_general/history.htm

Home Our Company Products Solutions ... Using AI History A papyrus, that was bought in a Luxor antique shop by Edwin Smith in 1882, was prepared representing 48 surgical observations of head wounds. The observations were stated in symptom-diagnosis-treatment-prognosis combinations as: IF a patient has this symptom, THEN he has this injury with this prognosis if this treatment is applied. This was the first known expert system. th C Leviathan, written by Thomas Hobbes (1588­1679), was published. In it he proposes that humans collectively, by virtue of their organization and use of their machines, would create a new intelligence. George B. Dyson refers to Hobbes as the patriarch of artificial intelligence in his book, "Darwin Among the Machines: The Evolution of Global Intelligence," p7, 1997. th C Leibnitz and Pascal invented mechanical computing devices. Pascal was 19 years old in 1642 when he invented an eight-digit calculator, the Pascaline. In 1694, Gottfried Liebnitz invented the Liebnitz Computer, which multiplied by repetitive addition, an algorithm still in use today. Leibnitz also conceived of a 'reasoning calculator' for interpreting and evaluating concepts, but realized the problem was immense because of the great interconnectedness of concepts. Jonathan Swift anticipated an automatic book writer in Gulliver's Travels.

105. ScienceDirect - Information Processing Letters : Some Observations Concerning Al by JH Chang 1987 - Cited by 24 - Related articles http://linkinghub.elsevier.com/retrieve/pii/0020019087900858

window.onresize = resizeWindow; Hub ScienceDirect Scopus Register ... Go to SciVal Suite Username: Password: Remember me Not Registered? Forgotten your username or password? Go to Athens / Institution login Home ... Help All fields Author Advanced search Journal/Book title Volume Issue Page Search tips Font Size: Related Articles Some observations concerning alternating turing machine... Information Processing Letters Some observations concerning alternating turing machines using small space : Information processing letters, vol. 25, no. 1, 20 April 1987, pp. 1-9 Information Processing Letters Volume 27, Issue 1 15 February 1988 Page 53 Jik H. Chang, Oscar H. Ibarra, Bala Ravikumar, Leonard Berman Purchase PDF (43 K) A remark on middle space bounded alternating Turing mac... Information Processing Letters A remark on middle space bounded alternating Turing machines Original Research Article Information Processing Letters Volume 56, Issue 4 24 November 1995 Pages 229-232 Carlo Mereghetti, Giovanni Pighizzini Abstract We prove a tight log n lower bound on middle space for one-way alternating Turing machines that accept nonregular tally languages. This is to be compared with the optimal

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