Machines, Computations, and Universality

DOI10.1007/B106980zbMATH Open1119.68081OpenAlexW4297931334MaRDI QIDQ5710883FDOQ5710883

Authors: Alain Colmerauer 

Publication date: 8 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b106980

Recommendations

• On machines, universal by extensions
• Universal Turing machines with complexity constraint
• scientific article; zbMATH DE number 3997169
• The Complexity of Small Universal Turing Machines
• The complexity of small universal Turing machines: A survey

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cited In (2)

• An almost machine-independent theory of program-length complexity, sophistication, and induction
• First-order universality for real programs

This page was built for publication: Machines, Computations, and Universality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710883)