Pages that link to "Item:Q5452180"
From MaRDI portal
The following pages link to The Church-Turing Thesis over Arbitrary Domains (Q5452180):
Displaying 18 items.
- The computable kernel of abstract state machines (Q959826) (← links)
- The influence of domain interpretations on computational models (Q1036525) (← links)
- Church's thesis and the conceptual analysis of computability (Q2472612) (← links)
- How much can analog and hybrid systems be proved (super-)Turing (Q2497875) (← links)
- An RNA-based theory of natural universal computation (Q2670144) (← links)
- Execution trace sets for real computation (Q2699944) (← links)
- Axiomatizing Analog Algorithms (Q3188259) (← links)
- (Q3568124) (← links)
- Three Paths to Effectiveness (Q3586000) (← links)
- A Natural Axiomatization of Computability and Proof of Church's Thesis (Q3616433) (← links)
- (Q4600389) (← links)
- ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS (Q5001552) (← links)
- (Q5013888) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
- What is the Church-Turing Thesis? (Q5055286) (← links)
- Church Without Dogma: Axioms for Computability (Q5384973) (← links)
- New Computational Paradigms (Q5717035) (← links)
- Theoretical computer science: computability, decidability and logic (Q6602262) (← links)