Three Paths to Effectiveness

DOI10.1007/978-3-642-15025-8_7zbMath1287.68043OpenAlexW1556566454MaRDI QIDQ3586000

Udi Boker, Nachum Dershowitz

Publication date: 3 September 2010

Published in: Fields of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15025-8_7

zbMATH Keywords

Turing machineseffectivenesscomputabilityrecursive functionsASMconstructiveness

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) General topics in the theory of algorithms (68W01)

Related Items (4)

What is the Church-Turing Thesis? ⋮ Axiomatizing Analog Algorithms ⋮ ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS ⋮ A Survey on Analog Models of Computation

Cites Work

• The computable kernel of abstract state machines
• The influence of domain interpretations on computational models
• Acceptable notation
• Comparing Computational Power
• A Natural Axiomatization of Computability and Proof of Church's Thesis
• CONSTRUCTIVE ALGEBRAS I
• The Church-Turing Thesis over Arbitrary Domains
• Computable Algebra, General Theory and Theory of Computable Fields
• A notion of effectiveness in arbitrary structures
• Sequential abstract-state machines capture sequential algorithms
• On Computable Numbers, with an Application to the Entscheidungsproblem

This page was built for publication: Three Paths to Effectiveness