On the complexity of universal programs

DOI10.1007/978-3-540-31834-7_2MaRDI QIDQ5710883zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

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: On the complexity of universal programs

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