Unconventional algorithms: complementarity of axiomatics and construction
From MaRDI portal
Publication:406192
DOI10.3390/e14112066zbMath1371.68082OpenAlexW2056740544MaRDI QIDQ406192
Gordana Dodig Crnkovic, Mark S. 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
unconventional computingaxiomatic models vs. constructive modelscomputation beyond the Turing limitunconventional models of computation
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Storage Modification Machines
- Information Flow
- Located sets and reverse mathematics
- Journeys in non-classical computation I: A grand challenge for computing research
- Computability of Recursive Functions
- The Tychonoff product theorem implies the axiom of choice
This page was built for publication: Unconventional algorithms: complementarity of axiomatics and construction
