Turing Machine

This is a discussion on Turing Machine within the Tech Board forums, part of the Community Boards category; Its said that the Turing machine is capable of the most powerful capacity to calculate over any computing mechanism known ...

  1. #1
    Registered User
    Join Date
    Jul 2005
    Posts
    7

    Turing Machine

    Its said that the Turing machine is capable of the most powerful capacity to calculate over any computing mechanism known to man. But I cant figure out how that could be as it appears to me to be the simplest computing machine and nothing more. I has the absolute minimum of all thats required to be a computer:
    - A single line (or tape) of one character symbols in its "program code"
    - One character capacity of RAM (in the reading head)
    -It can only read one symbol or write on symbol at a time
    The only thing I can see that makes it complex is the internal instrction set that the reading head uses to react to the symbols it reads. So whats so special about the Turing Machine over any other computing machine?

  2. #2
    Super Moderator
    Join Date
    Sep 2001
    Posts
    4,913
    If you could make the most powerful computing mechanism known to man out of a couple of dice, a pencil, and a roll of toilet paper, NASA wouldn't spend billions of dollars on Crays and the like.

    A simple Turing machine is certainly NOT the most powerful computing mechanism, so wherever you got that information from may very well be implying something else. The principles behind simple Turing machines are the same basic principles used in making all computers, so perhaps they were saying that a simple Turing machine was not all that different from the most powerful computing mechanisms.

  3. #3
    Registered User
    Join Date
    Jul 2005
    Posts
    7
    Well if you check the page on Wikipedia for Turing Machines:
    http://en.wikipedia.org/wiki/Turing_machine
    youll see this in the second section:
    A Turing machine is a pushdown automaton made more powerful by relaxing the last-in-first-out requirement of its stack. (Interestingly, this seemingly minor relaxation enables the Turing machine to perform such a wide variety of computations that it can serve as a model for the computational capabilities of all modern computer software.)
    And after reading that I still dont see what makes it such a universal model for computing other than its simplity.

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Machine Learning with Lego Mindstorms
    By DavidP in forum A Brief History of Cprogramming.com
    Replies: 14
    Last Post: 01-30-2009, 02:34 PM
  2. Replies: 4
    Last Post: 01-18-2008, 07:05 PM
  3. School Mini-Project on C/C++ (Need Your Help)..
    By EazTerence in forum C++ Programming
    Replies: 4
    Last Post: 09-08-2005, 02:08 AM
  4. Porting from 32 bit machine to 64 bit machine!
    By anoopks in forum C Programming
    Replies: 10
    Last Post: 02-25-2005, 08:02 PM
  5. IDEA: Turing Machine
    By ygfperson in forum Contests Board
    Replies: 0
    Last Post: 08-13-2002, 12:08 AM

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21