Honest universality

DOI10.1098/RSTA.2012.0220MaRDI QIDQ2941591zbMATH OpenOpenAlexWikidataFDO

Authors Nachum Dershowitz, Evgenia Falkovich

Publication date 21 August 2015

Published in Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1098/rsta.2012.0220

zbMATH Keywords

computabilityeffectivenessencodingrepresentationuniversal function

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Recommendations

• Some considerations on universality
• scientific article; zbMATH DE number 1512850
• scientific article; zbMATH DE number 3878916
• Universality and almost decidability
• Honest computability and complexity

Cites work

• A Natural Axiomatization of Computability and Proof of Church's Thesis
• Acceptable notation
• Comparing Computational Power
• Computable Algebra, General Theory and Theory of Computable Fields
• scientific article; zbMATH DE number 1543044 (Why is no real title available?)
• On Universal Functions
• Sequential abstract-state machines capture sequential algorithms
• The computable kernel of abstract state machines
• The Definition of Universal Turing Machine

Cited in

(3)

• The foundations of computation, physics and mentality: the Turing legacy
• Honest computability and complexity
• Some considerations on universality

This page was built for publication: Honest universality

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