Pages that link to "Item:Q3616433"
From MaRDI portal
The following pages link to A Natural Axiomatization of Computability and Proof of Church's Thesis (Q3616433):
Displaying 27 items.
- Unconventional algorithms: complementarity of axiomatics and construction (Q406192) (← links)
- Defining effectiveness using finite sets. A study on computability (Q529651) (← links)
- Is there any real substance to the claims for a ``new computationalism''? (Q2011631) (← links)
- Semantics of quantum programming languages: Classical control, quantum control (Q2168785) (← links)
- Church's thesis and the conceptual analysis of computability (Q2472612) (← links)
- An RNA-based theory of natural universal computation (Q2670144) (← links)
- Proving Church's thesis (Q2701936) (← links)
- What Is an Algorithm? (Q2891359) (← links)
- Honest universality (Q2941591) (← links)
- Axiomatizing Analog Algorithms (Q3188259) (← links)
- Honest Computability and Complexity (Q3305319) (← links)
- Three Paths to Effectiveness (Q3586000) (← links)
- ASMs and Operational Algorithmic Completeness of Lambda Calculus (Q3586009) (← links)
- Step by Recursive Step: Church's Analysis of Effective Calculability (Q4359525) (← links)
- (Q4395619) (← links)
- Conceptual Confluence in 1936: Post and Turing (Q4637215) (← links)
- Theses for Computation and Recursion on Concrete and Abstract Structures (Q4637218) (← links)
- Semantics-to-Syntax Analyses of Algorithms (Q4637221) (← links)
- Why Turing’s Thesis Is Not a Thesis (Q4637226) (← links)
- (Q5013820) (← 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)
- The Church-Turing Thesis over Arbitrary Domains (Q5452180) (← links)
- The decision problem for effective procedures (Q6113688) (← links)
- Theoretical computer science: computability, decidability and logic (Q6602262) (← links)
