Unconventional algorithms: complementarity of axiomatics and construction
From MaRDI portal
Publication:406192
DOI10.3390/E14112066zbMATH Open1371.68082OpenAlexW2056740544MaRDI QIDQ406192FDOQ406192
Authors: Gordana Dodig-Crnkovic, Mark Burgin
Publication date: 8 September 2014
Published in: Entropy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/e14112066
Recommendations
unconventional computingaxiomatic models vs. constructive modelscomputation beyond the Turing limitunconventional models of computation
Cites Work
- Journeys in non-classical computation I: A grand challenge for computing research
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Storage Modification Machines
- Title not available (Why is that?)
- Information Flow
- Weak comparability of well orderings and reverse mathematics
- Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
- A Natural Axiomatization of Computability and Proof of Church's Thesis
- Axiomatic recursion theory and the continuous functionals
- Title not available (Why is that?)
- Title not available (Why is that?)
- Located sets and reverse mathematics
- Theory of information. Fundamentality, diversity and unification.
- Computability of Recursive Functions
- The Tychonoff product theorem implies the axiom of choice
Cited In (1)
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)