Turing machine

From Scholarpedia

Election of authors. Voted 71 since 11 January 2008.

Public election of authors
Please, vote for the candidate(s) whom you would like to write this article (or whose version of the article you would like to read). Your vote is anonymous. You are not logged in. Your vote will be assigned to IP address 38.103.63.60 Anybody from the same IP address can change your vote. You need to login to avoid this problem. A soft-max (probabilistic) procedure will be used to choose the author based on the number of votes received.

Candidates are listed in the order they were nominated:


Name/Email/AffiliationBrief note
John E. Hopcroft (edit)
(jehATcs dot cornell dot edu)
Computer Science Department, Cornell University, NY
Professor Hopcroft is the IBM Professor of Engineering and Applied Mathematics in Computer Science at Cornell University. He was honored with the A. M. Turing Award in 1986. In addition to his research work, he is well known for his books on algorithms and formal languages coauthored with Jeffrey Ullman and Alfred Aho, regarded as classic texts in the field.
Marvin Minsky (edit)
(Marvin Minsky media.mit.edu>)
CSAIL and Media Lab, MIT
A well-known researcher of artificial intelligence, Minsky wrote the book Computation: Finite and Infinite Machines (Automatic Computation) in 1967, that covers automata theory.
Stephen Wolfram (edit)
(s.wolframATwolfram.com)
Wolfram Research, Inc.
Stephen Wolfram is a physicist known for his work in cellular automata and creator of Mathematica. He found the simplest known Universal Turing machine (2,5), outlined in his popular book A New Kind of Science.


(edit article category)
For authors