Unconventional algorithms: complementarity of axiomatics and construction
From MaRDI portal
unconventional computingaxiomatic models vs. constructive modelscomputation beyond the Turing limitunconventional models of computation
Recommendations
Cites work
- scientific article; zbMATH DE number 3722109 (Why is no real title available?)
- scientific article; zbMATH DE number 52976 (Why is no real title available?)
- scientific article; zbMATH DE number 3513761 (Why is no real title available?)
- scientific article; zbMATH DE number 1201510 (Why is no real title available?)
- scientific article; zbMATH DE number 1226875 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- A Natural Axiomatization of Computability and Proof of Church's Thesis
- Axiomatic recursion theory and the continuous functionals
- Computability of Recursive Functions
- Information Flow
- Journeys in non-classical computation I: A grand challenge for computing research
- Located sets and reverse mathematics
- Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
- Storage Modification Machines
- The Tychonoff product theorem implies the axiom of choice
- Theory of information. Fundamentality, diversity and unification.
- Weak comparability of well orderings and reverse mathematics
This page was built for publication: Unconventional algorithms: complementarity of axiomatics and construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406192)