Turning Machine


{ Prove (or disprove) that a particular very simple Turning machine can act as a universal computer. }

What dose the above sentence mean?

(Answer in Chinese is fine.)

2 Answers

  • 1 decade ago
    Favorite Answer

    The Turing Machine is an abstract machine introduced in 1936 by Alan Turing to give a mathematically precise definition of algorithm (or “mechanical procedure”).

    Each Turing machine can be viewed as a specifically programmed computer.

    A Turing Machine is a kind of state machine, which has an infinite one-dimensional tape divided into cells.

    The machine has a read-write head, which at any time scanning a single cell on the tape. This read-write head can move left and right along the tape to scan cells.

    The machine is determined completely by (1) its current state, (2) the symbol in the cell currently being scanned and (3) a table of transition rules, which serve as the “program” for the machine.

    Each transition rule is a 4-tuple: < State0, Symbol, Statenext, Action >

    The actions available are either to write a symbol on the tape in the current cell, or to move the head one cell to the left or right.

    以上命題係叫做 "Church-Turing thesis"

    Source(s): Jack Copeland, Artificial Intelligence: A Philosophical Introduction (Oxford: Blackwell 1993), Ch. 9-10.
    • Login to reply the answers
  • 1 decade ago

    The website have more information can click the website.

    www.money128.biz and www.fast-beauty.6289.us

    • Login to reply the answers
Still have questions? Get your answers by asking now.