Find link

language:

Find link is a tool written by Edward Betts.

searching for Universal Turing machine 20 found (124 total)

alternate case: universal Turing machine

Roman Verostko (1,508 words) [view diff] case mismatch in snippet view article find links to article

Scriptures, the Diamond Lake Apocalypse and the Manchester Illuminated Universal Turing Machine, produced in honor of Alan Turing. In 1990, Verostko published

Turmite (1,086 words) [view diff] case mismatch in snippet view article find links to article

Beaver Game and the Meaning of Life". In Rolf Herken (ed.). The Universal Turing Machine: A Half-Century Survey. Springer-Verlag. ISBN 0-19-853741-7. Brady

Ordinal logic (207 words) [view diff] exact match in snippet view article find links to article

ordinal. Solomon Feferman, Turing in the Land of O(z) in "The universal Turing machine: a half-century survey" by Rolf Herken 1995 ISBN 3-211-82637-8

Logic in computer science (1,721 words) [view diff] case mismatch in snippet view article find links to article

Mathematical Logic on Computer Science". In Rolf Herken (ed.). The Universal Turing Machine. Springer Verlag. ISBN 9783211826379. Retrieved 26 December 2013

Arbitrary code execution (1,013 words) [view diff] case mismatch in snippet view article find links to article

for Vulnerability in Computers? Arbitrary Code Execution in the Universal Turing Machine". arXiv:2105.02124. {{cite journal}}: Cite journal requires |journal=

Edward F. Moore (533 words) [view diff] exact match in snippet view article find links to article

Encodings", "The Shortest Path Through a Maze", "A simplified universal Turing machine", and "Complete Relay Decoding Networks". "Machine models of self-reproduction

Logical depth (300 words) [view diff] case mismatch in snippet view article find links to article

"Logical Depth and Physical Complexity", in Herken, Rolf (ed.), The Universal Turing Machine: a Half-Century Survey, Oxford U. Press, pp. 227–257, CiteSeerX 10

Systems of Logic Based on Ordinals (459 words) [view diff] exact match in snippet view article find links to article

11116/0000-0001-91CE-3. Solomon Feferman, Turing in the Land of O(z) in "The universal Turing machine: a half-century survey" by Rolf Herken 1995 ISBN 3-211-82637-8

Sophistication (complexity theory) (230 words) [view diff] case mismatch in snippet view article

Koppel, Moshe (1995). Herken, Rolf (ed.). "Structure". The Universal Turing Machine (2nd Ed.). Springer-Verlag New York, Inc.: 403–419. ISBN 3-211-82637-8

Minimum message length (1,382 words) [view diff] case mismatch in snippet view article find links to article

complexity (within a constant, depending on the particular choice of Universal Turing Machine); MML is typically a computable approximation (see ) Minimum description

Polynomial hierarchy (2,690 words) [view diff] exact match in snippet view article find links to article

ISBN 978-0-521-42426-4. section 1.4, "Machines as strings and the universal Turing machine" and 1.7, "Proof of theorem 1.9" A. R. Meyer and L. J. Stockmeyer

Reversible computing (2,372 words) [view diff] exact match in snippet view article find links to article

ethnolinguistics. In 1973 Charles H. Bennett, at IBM Research, showed that a universal Turing machine could be made both logically and thermodynamically reversible,

Evolutionary computation (2,960 words) [view diff] exact match in snippet view article find links to article

enumerable but not recursive languages (e.g., language of the universal Turing machine). The list of active researchers is naturally dynamic and non-exhaustive

Formal language (3,070 words) [view diff] exact match in snippet view article find links to article

Mathematical Logic on Computer Science". In Rolf Herken (ed.). The universal Turing machine: a half-century survey. Springer. p. 290. ISBN 978-3-211-82637-9

Space hierarchy theorem (2,699 words) [view diff] exact match in snippet view article find links to article

of the space hierarchy theorem, but with two complications: The universal Turing machine has to be space-efficient, and the reversal has to be space-efficient

No free lunch in search and optimization (3,264 words) [view diff] exact match in snippet view article find links to article

concerned. So presume that there is one, clearly superior choice of universal Turing machine. Then given an objective function that is incompressible for that

Semi-Thue system (3,402 words) [view diff] exact match in snippet view article find links to article

undecidable halting problem means that the halting problem for a universal Turing machine is undecidable (since that can simulate any Turing machine), and

Charles F. Hockett (3,759 words) [view diff] exact match in snippet view article find links to article

is a well-defined system by definition not more powerful than a universal Turing machine (and, in fact, surely a great deal weaker). The crux of Hockett's

Busy beaver (5,773 words) [view diff] case mismatch in snippet view article find links to article

Beaver Game and the Meaning of Life". In Herken, Rolf (ed.). The Universal Turing Machine: A Half-Century Survey (2nd ed.). Wien, New York: Springer-Verlag

Lateral computing (4,212 words) [view diff] case mismatch in snippet view article find links to article

2nd Edition, Pearson Education Publishers. R. Herken (1995); Universal Turing Machine, Springer-Verlag 2nd Edition. Harry R. Lewis, Christos H. Papadimtrou