Unconventional Algorithms: Complementarity of Axiomatics and Construction

Dodig-Crnković, Gordana; Burgin, Mark

doi:10.3390/e14112066

Cited by 6 publications

(2 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Dodig-Crnkovic and Burgin, in present volume analyze methodological and philosophical implications of algorithmic aspects of unconventional/natural computation that extends the closed classical universe of computation of the Turing machine type. The new model constitute an open world of algorithmic constellations, allowing increased flexibility and expressive power, supporting constructivism and creativity in mathematical modeling and enabling richer understanding of computation, see [12].…”

Section: On Parasitic Computing That Implements Computation On the Comentioning

confidence: 99%

Computing Nature – A Network of Networks of Concurrent Information Processes

Dodig-Crnković

Giovagnoli

2013

Studies in Applied Philosophy, Epistemology and Rational Ethics

View full text Add to dashboard Cite

This book is about nature considered as the totality of physical existence, the universe. By physical we mean all phenomena -objects and processes -that are possible to detect either directly by our senses or via instruments. Historically, there have been many ways of describing the universe (cosmic egg, cosmic tree, theistic universe, mechanistic universe) while a particularly prominent contemporary approach is computational universe.One of the most important pioneers of computing, Turing, described by Hodges as natural philosopher, can be identified as a forerunner and founder of the notion of computing nature and natural computing through his morphological computing and "unorganized" (neural-network type) machines. Dodig-Crnkovic and Basti in this volume address Turing's role as a pioneer of natural computing. Present day computers are distinctly different from the early stand-alone calculating machines that Turing helped construct, designed to mechanize computation of mathematical functions. Computers today are networked and largely used for worldwide communication and variety of information processing and knowledge management. They are cognitive tools of extended mind used in social interactions and ever growing repositories of information. Moreover, computers play an important role in the control of physical processes and thus connect directly to the physical world, especially in automation, traffic control and robotics. Apart from classical engineering and hard-scientific domains, computing has in recent decades pervaded new fields such as biology and social sciences, humanities and arts -all previously considered as typical soft, non-mechanical and unautomatable domains.

show abstract

Section: On Parasitic Computing That Implements Computation On the Comentioning

confidence: 99%

Computing Nature – A Network of Networks of Concurrent Information Processes

Dodig-Crnković

Giovagnoli

2013

Studies in Applied Philosophy, Epistemology and Rational Ethics

View full text Add to dashboard Cite

show abstract

“…Combining the above observation with the fact that Moore's law is reaching its limits, it is becoming more and more obvious that we need to search for novel technologies and computation models [4,5]. Quantum computing, a concept that perceives the computing process as a natural phenomenon, could be one potential substitute or an addition to the standard computation methods.…”

Section: Introductionmentioning

confidence: 99%

Dominant Strategies of Quantum Games on Quantum Periodic Automata

et al. 2015

View full text Add to dashboard Cite

Game theory and its quantum extension apply in numerous fields that affect people's social, political, and economical life. Physical limits imposed by the current technology used in computing architectures (e.g., circuit size) give rise to the need for novel mechanisms, such as quantum inspired computation. Elements from quantum computation and mechanics combined with game-theoretic aspects of computing could open new pathways towards the future technological era. This paper associates dominant strategies of repeated quantum games with quantum automata that recognize infinite periodic inputs. As a reference, we used the PQ-PENNY quantum game where the quantum strategy outplays the choice of pure or mixed strategy with probability 1 and therefore the associated quantum automaton accepts with probability 1. We also propose a novel game played on the evolution of an automaton, where players' actions and strategies are also associated with periodic quantum automata.

show abstract