Halting problem - Wikipedia, the free encyclopedia
    However, there are some heuristics that can be used in an automated .. it likely that he first used the term 'halting problem' in a series of lectures that Marvin Minsky, Computation, Finite and Infinite Machines, Prentice-Hall, Inc., N.J., 1967.
    A note on the undecidability of the reachability - Université de Mons
    Marvin L. Minsky, Computation: finite and infinite machines, Prentice-Hall Inc., Englewood Cliffs,. N.J., 1967, Prentice-Hall Series in Automatic Computation.
    Computation: Finite and infinite machines (PrenticeHall series in
    Prentice Hall. Computation : Finite and Infinite Machines ( Prentice-Hall Series in Automatic Computation ) [Marvin Lee Minsky] on Amazon.com
    Prentice-Hall Series in Automatic Computation
    Title, Computation : finite and infinite machines. Publisher, New Jersey Prentice- Hall 1967. Series Stmt, Prentice-Hall Series in Automatic Computation
    Computation: Finite and Infinite Machines - Marvin  - Google Books
    Title, Computation: Finite and Infinite Machines Series in Automatic computation · Open University set book · Prentice-Hall Series in Automatic Computation
    Computation: Finite and Infinite Machines (Prentice-Hall series in
    Computation: Finite and Infinite Machines (Prentice-Hall series in automatic computation) प्रक्रिया: MyBundle में जोड़ें · इच्छा सूची में
    ZSR | Catalog - Holdings: Computation: finite and infinite machines /
    Computation: finite and infinite machines / Published: Englewood Cliffs, N.J. : Prentice-Hall, 1967. Series: Prentice-Hall series in automatic computation.
    Computability by probabilistic Turing machines
    Abstract: In the present paper, the definition of probabilistic Turing machines is [7] Marvin L. Minsky, Computation: finite and infinite machines, Prentice-Hall Inc., Englewood Cliffs, N.J., 1967. Prentice-Hall Series in Automatic Computation.
    Catalog - Computation: finite and infinite machines [by] Marvin L
    Keyword, Title, Author, Subject, Series. in Computation: finite and infinite machines [by] Marvin L. Minsky. ‡aPrentice-Hall series in automatic computation
    Computation: Finite and Infinite Machines - Marvin  - Google Books
    Title, Computation: Finite and Infinite Machines Prentice Hall series in Automatic Computation. Author, Marvin Lee Minsky. Publisher, Prentice Hall, 1972
    handouts (pdf)
    Computation: Finite and Infinite Machines. Prentice-Hall Series in Automatic Computation. Prentice-Hall, Inc., Englewood Cliffs, N.J. (1967) [9]Angluin,
    BibSonomy :: publication :: Computation: Finite and Infinite Machines
    Computation: Finite and Infinite Machines · Marvin L. Minsky. Prentice-Hall Series in Automatic Computation Prentice-Hall, Englewood Cliffs, N. J., (1967)
    Computation: Finite and infinite machines (Prentice &Hall series in
    Computation: Finite and infinite machines (Prentice &Hall series in automatic computation), AH 76. Submitted by angeviern on Sat, 04/09/2011 - 17:19
    Computation: Finite and Infinite Machines (Prentice-Hall series in
    Computation: Finite and Infinite Machines (Prentice-Hall series in automatic computation) Actions: Add to MyBundle · Add to Wish List · Set Price Alert Ship To :
    Computation - CERN Document Server
    Home > Computation Title, Computation : finite and infinite machines. Author(s) Series, (Prentice-Hall series in automatic computation)