Computation: Finite and infinite machines (Prentice;Hall series in automatic computation). Marvin Lee Minsky

Computation: Finite and infinite machines (Prentice;Hall series in automatic computation)


Computation.Finite.and.infinite.machines.Prentice.Hall.series.in.automatic.computation..pdf
ISBN: , | 317 pages | 8 Mb


Download Computation: Finite and infinite machines (Prentice;Hall series in automatic computation)



Computation: Finite and infinite machines (Prentice;Hall series in automatic computation) Marvin Lee Minsky
Publisher: Prentice-Hall




Series: Prentice-Hall series in automatic computation. Computation: Finite and Infinite Machines (Automatic Computation) by Marvin Lee Minsky and a Prentice-Hall series in automatic computation. The limit on computational power of our model is nontrivial. Computation: finite and infinite machines. Muller Prefix-like Complexities of Finite and Infinite Sequences on Generalized Turing Machines. Computation: Finite and Infinite Machines (Prentice-Hall Series in Automatic Computation) by Marvin Lee Minsky. Computation: finite and infinite machines Published: Englewood Cliffs, N.J., Prentice-Hall 1967. We show a lower bound on the computational power of this model by Type-2 machine simulation. Looking for Computation: Finite and Infinite Machines by Marvin Lee Minsky? Keyword, Title, Author, Subject, Series. Minsky Series title: (Prentice-Hall series in automatic computation); Bibliography note: Bibliography: p. Computation: finite and infinite machines Prentice-Hall, Inc. In Computation: finite and infinite machines [by] Marvin L. Infinite sequences and finite machines. Upper Saddle River, NJ, USA ©1967 ACM-CBS: ACM Classic Books Series Burks, Arthur W.