Three paths to effectiveness

DOI10.1007/978-3-642-15025-8_7MaRDI QIDQ3586000zbMATH OpenOpenAlexFDO

Authors 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

ASMcomputabilityconstructivenesseffectivenessrecursive functionsTuring machines

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7340320
• Abstract effective models
• Means-fit effectivity
• On Gurevich's theorem on sequential algorithms
• scientific article; zbMATH DE number 2172808

Cites work

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

Cited in

(6)

• Abstract effective models
• Axiomatizing analog algorithms
• ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS
• Means-fit effectivity
• A Survey on Analog Models of Computation
• What is the Church-Turing Thesis?

This page was built for publication: Three paths to effectiveness

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