Next Article in Journal
Temperature Effects, Frieden–Hawkins’ Order-Measure, and Wehrl Entropy
Next Article in Special Issue
Life as Thermodynamic Evidence of Algorithmic Structure in Natural Environments
Previous Article in Journal
The Completed Self: An Immunological View of the Human-Microbiome Superorganism and Risk of Chronic Diseases
Previous Article in Special Issue
Programming Unconventional Computers: Dynamics, Development, Self-Reference
Open AccessArticle

Unconventional Algorithms: Complementarity of Axiomatics and Construction

1
Department of Computer Science and Networks, School of Innovation, Design and Engineering Mälardalen University, Västerås, 72123, Sweden
2
Department of Mathematics, UCLA, Los Angeles, CA 90095, USA
*
Author to whom correspondence should be addressed.
Entropy 2012, 14(11), 2066-2080; https://doi.org/10.3390/e14112066
Received: 20 August 2012 / Accepted: 19 October 2012 / Published: 25 October 2012
In this paper, we analyze axiomatic and constructive issues of unconventional computations from a methodological and philosophical point of view. We explain how the new models of algorithms and unconventional computations change the algorithmic universe, making it open and allowing increased flexibility and expressive power that augment creativity. At the same time, the greater power of new types of algorithms also results in the greater complexity of the algorithmic universe, transforming it into the algorithmic multiverse and demanding new tools for its study. That is why we analyze new powerful tools brought forth by local mathematics, local logics, logical varieties and the axiomatic theory of algorithms, automata and computation. We demonstrate how these new tools allow efficient navigation in the algorithmic multiverse. Further work includes study of natural computation by unconventional algorithms and constructive approaches. View Full-Text
Keywords: unconventional computing; computation beyond the Turing limit; axiomatic vs. constructive models; unconventional models of computation unconventional computing; computation beyond the Turing limit; axiomatic vs. constructive models; unconventional models of computation
MDPI and ACS Style

Dodig Crnkovic, G.; Burgin, M. Unconventional Algorithms: Complementarity of Axiomatics and Construction. Entropy 2012, 14, 2066-2080.

Show more citation formats Show less citations formats

Article Access Map by Country/Region

1
Only visits after 24 November 2015 are recorded.
Back to TopTop