Super-Recursive Algorithms

Super-Recursive Algorithms
Author: Mark Burgin
Publisher: Springer Science & Business Media
Total Pages: 314
Release: 2006-12-21
Genre: Mathematics
ISBN: 0387268065

* The first exposition on super-recursive algorithms, systematizing all main classes and providing an accessible, focused examination of the theory and its ramifications * Demonstrates how these algorithms are more appropriate as mathematical models for modern computers and how they present a better framework for computing methods * Develops a new practically-oriented perspective on the theory of algorithms, computation, and automata, as a whole

Super-Recursive Algorithms

Super-Recursive Algorithms
Author: Mark Burgin
Publisher: Springer
Total Pages: 0
Release: 2010-12-06
Genre: Mathematics
ISBN: 9781441930606

* The first exposition on super-recursive algorithms, systematizing all main classes and providing an accessible, focused examination of the theory and its ramifications * Demonstrates how these algorithms are more appropriate as mathematical models for modern computers and how they present a better framework for computing methods * Develops a new practically-oriented perspective on the theory of algorithms, computation, and automata, as a whole

Computing Nature

Computing Nature
Author: Gordana Dodig-Crnkovic
Publisher: Springer Science & Business Media
Total Pages: 268
Release: 2013-03-21
Genre: Technology & Engineering
ISBN: 3642372252

This book is about nature considered as the totality of physical existence, the universe, and our present day attempts to understand it. If we see the universe as a network of networks of computational processes at many different levels of organization, what can we learn about physics, biology, cognition, social systems, and ecology expressed through interacting networks of elementary particles, atoms, molecules, cells, (and especially neurons when it comes to understanding of cognition and intelligence), organs, organisms and their ecologies? Regarding our computational models of natural phenomena Feynman famously wondered: “Why should it take an infinite amount of logic to figure out what one tiny piece of space/time is going to do?” Phenomena themselves occur so quickly and automatically in nature. Can we learn how to harness nature’s computational power as we harness its energy and materials? This volume includes a selection of contributions from the Symposium on Natural Computing/Unconventional Computing and Its Philosophical Significance, organized during the AISB/IACAP World Congress 2012, held in Birmingham, UK, on July 2-6, on the occasion of the centenary of Alan Turing’s birth. In this book, leading researchers investigated questions of computing nature by exploring various facets of computation as we find it in nature: relationships between different levels of computation, cognition with learning and intelligence, mathematical background, relationships to classical Turing computation and Turing’s ideas about computing nature - unorganized machines and morphogenesis. It addresses questions of information, representation and computation, interaction as communication, concurrency and agent models; in short this book presents natural computing and unconventional computing as extension of the idea of computation as symbol manipulation.

Theory of Information

Theory of Information
Author: Mark Burgin
Publisher: World Scientific
Total Pages: 689
Release: 2010
Genre: Computers
ISBN: 9812835482

Presents a fresh approach to scientific understanding of information phenomena. Based on an analysis of information processes in nature, technology, and society, as well as on the main directions in information theory, this book offers a theory that synthesizes various directions into a unified system.

Information and Computation

Information and Computation
Author: Mark Semenovich Burgin
Publisher: World Scientific
Total Pages: 530
Release: 2011
Genre: Computers
ISBN: 9814295485

This volume provides a cutting-edge view of the world's leading authorities in fields where information and computation play a central role.

Advances in Unconventional Computing

Advances in Unconventional Computing
Author: Andrew Adamatzky
Publisher: Springer
Total Pages: 868
Release: 2016-07-18
Genre: Technology & Engineering
ISBN: 3319339249

The unconventional computing is a niche for interdisciplinary science, cross-bred of computer science, physics, mathematics, chemistry, electronic engineering, biology, material science and nanotechnology. The aims of this book are to uncover and exploit principles and mechanisms of information processing in and functional properties of physical, chemical and living systems to develop efficient algorithms, design optimal architectures and manufacture working prototypes of future and emergent computing devices. This first volume presents theoretical foundations of the future and emergent computing paradigms and architectures. The topics covered are computability, (non-)universality and complexity of computation; physics of computation, analog and quantum computing; reversible and asynchronous devices; cellular automata and other mathematical machines; P-systems and cellular computing; infinity and spatial computation; chemical and reservoir computing. The book is the encyclopedia, the first ever complete authoritative account, of the theoretical and experimental findings in the unconventional computing written by the world leaders in the field. All chapters are self-contains, no specialist background is required to appreciate ideas, findings, constructs and designs presented. This treatise in unconventional computing appeals to readers from all walks of life, from high-school pupils to university professors, from mathematicians, computers scientists and engineers to chemists and biologists.

Neural Networks and Analog Computation

Neural Networks and Analog Computation
Author: Hava T. Siegelmann
Publisher: Springer Science & Business Media
Total Pages: 193
Release: 2012-12-06
Genre: Computers
ISBN: 146120707X

The theoretical foundations of Neural Networks and Analog Computation conceptualize neural networks as a particular type of computer consisting of multiple assemblies of basic processors interconnected in an intricate structure. Examining these networks under various resource constraints reveals a continuum of computational devices, several of which coincide with well-known classical models. On a mathematical level, the treatment of neural computations enriches the theory of computation but also explicated the computational complexity associated with biological networks, adaptive engineering tools, and related models from the fields of control theory and nonlinear dynamics. The material in this book will be of interest to researchers in a variety of engineering and applied sciences disciplines. In addition, the work may provide the base of a graduate-level seminar in neural networks for computer science students.

Machines, Computations, and Universality

Machines, Computations, and Universality
Author: Jérôme Durand-Lose
Publisher: Springer Science & Business Media
Total Pages: 333
Release: 2007-08-23
Genre: Computers
ISBN: 3540745920

This book constitutes the refereed proceedings of the 5th International Conference on Machines, Computations, and Universality, MCU 2007, held in Orleans, France, September 2007. The 18 revised full papers presented together with nine invited papers cover Turing machines, register machines, word processing, cellular automata, tiling of the plane, neural networks, molecular computations, BSS machines, infinite cellular automata, real machines, and quantum computing.

Computational Mathematics, Modelling and Algorithms

Computational Mathematics, Modelling and Algorithms
Author: J. C. Misra
Publisher: Alpha Science Int'l Ltd.
Total Pages: 540
Release: 2003
Genre: Computers
ISBN: 9788173194900

This comprehensive volume introduces educational units dealing with important topics in Mathematics, Modelling and Algorithms. Key Features: Illustrative examples and exercises Comprehensive bibliography

Algorithms

Algorithms
Author: Lydia Kronsjö
Publisher:
Total Pages: 392
Release: 1987-04-28
Genre: Mathematics
ISBN:

Like the first edition, this book is concerned with the study of algorithms and their complexity, and the evaluation of their performance.