Perfect Local Computability and Computable Simulations

DOI10.1007/978-3-540-69407-6_48MaRDI QIDQ3507461zbMATH OpenOpenAlexFDO

Authors Dustin Mulcahey, Russell Miller

Publication date 19 June 2008

Published in Logic and Theory of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69407-6_48

zbMATH Keywords

category theorycomputabilitylocal computabilityperfect local computability

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Abstract and axiomatic computability and recursion theory (03D75)

Recommendations

• Locally Computable Structures
• Structures computable in polynomial time. I
• Computability structures, simulations and realizability
• Degrees of presentability of structures. II
• Local computability for ordinals

Cites work

• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 822489 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• Local computability and uncountable structures
• Locally Computable Structures

Cited in

(4)

• Perfect simulation for locally continuous chains of infinite order
• Locally Computable Structures
• Perfect Local Computability of Superatomic Boolean Algebras
• An interpretation of Shenoy and Shafer's axioms for local computation

This page was built for publication: Perfect Local Computability and Computable Simulations

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