Unconventional Algorithms: Complementarity of Axiomatics and Construction
Artikel i vetenskaplig tidskrift, 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. © 2012 by the authors; licensee MDPI, Basel, Switzerland.

Unconventional models of computation

Unconventional computing

Computation beyond the Turing limit

Axiomatic vs. constructive models


Gordana Dodig Crnkovic

Mark Burgin


1099-4300 (ISSN)

Vol. 14 11 2066-2080


Informations- och kommunikationsteknik



Data- och informationsvetenskap

Elektroteknik och elektronik

Datavetenskap (datalogi)


Grundläggande vetenskaper


C3SE (Chalmers Centre for Computational Science and Engineering)