Unconventional Algorithms: Complementarity of Axiomatics and Construction

Entropy

Gordana Dodig Crnkovic¹ 

[1] Department of Computer Science and Networks, School of Innovation, Design and Engineering Mälardalen University, Västerås, 72123, Sweden

关键词: unconventional computing;    computation beyond the Turing limit;    axiomatic vs. constructive models;    unconventional models of computation;   

DOI  :  10.3390/e14112066

来源: mdpi

【 摘 要 】

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.

【 授权许可】

CC BY   
© 2012 by the authors; licensee MDPI, Basel, Switzerland.