The Church-Turing Thesis over Arbitrary Domains
From MaRDI portal
Publication:5452180
DOI10.1007/978-3-540-78127-1_12zbMath1133.03018OpenAlexW2169961916MaRDI QIDQ5452180
Publication date: 25 March 2008
Published in: Pillars of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78127-1_12
Related Items (12)
What is the Church-Turing Thesis? ⋮ Axiomatizing Analog Algorithms ⋮ An RNA-based theory of natural universal computation ⋮ Unnamed Item ⋮ Execution trace sets for real computation ⋮ The computable kernel of abstract state machines ⋮ Three Paths to Effectiveness ⋮ How much can analog and hybrid systems be proved (super-)Turing ⋮ A Natural Axiomatization of Computability and Proof of Church's Thesis ⋮ The influence of domain interpretations on computational models ⋮ ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS ⋮ A Survey on Analog Models of Computation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Acceptable notation
- Church's thesis and the conceptual analysis of computability
- Effective procedures in field theory
- Comparing Computational Power
- A Natural Axiomatization of Computability and Proof of Church's Thesis
- Why Gödel didn't have church's thesis
- CONSTRUCTIVE ALGEBRAS I
- Church Without Dogma: Axioms for Computability
- Computable Algebra, General Theory and Theory of Computable Fields
- A notion of effectiveness in arbitrary structures
- New Computational Paradigms
- Sequential abstract-state machines capture sequential algorithms
- An Unsolvable Problem of Elementary Number Theory
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- Systems of Logic Based on Ordinals†
- Recursive Predicates and Quantifiers
This page was built for publication: The Church-Turing Thesis over Arbitrary Domains
