Super-recursive algorithms.

From MaRDI portal





Algorithms and automata that are more powerful than Turing machines are called super-recursive and computations that cannot be realized or simulated by Turing machines are called hypercomputations. A new paradigm for computation, the super-recursive algorithm, offers promising prospects for algorithms of greater computing power and efficiency, going beyond the Church-Turing Thesis, which governs the algorithmic universe and asserts the conventionality of recursive algorithms. This book provides an examination of the theory of super-recursive algorithms and its ramifications for the computer industry, networks, artificial intelligence, embedded systems, and the Internet. The book demonstrates how these algorithms are more appropriate as mathematical models for modern computers, and how these algorithms present a better framework for computing methods in such areas as numerical analysis, array searching, and controlling and monitoring systems. In addition, a new practically-oriented perspective on the theory of algorithms, computation, and automata, as a whole, is developed. Problems of efficiency, software development, parallel and distributed processing, pervasive and emerging computation, computer architecture, machine learning, brain modeling, knowledge discovery, and intelligent systems are addressed. The author encompasses and systematizes all main classes of super-recursive algorithms and the theory behind them. The book describes the strengthening link between the theory of super-recursive algorithms and actual algorithms close to practical realization; examines the theory's basis as a foundation for advancements in computing, information science, and related technologies; highlights how super-recursive algorithms pave the way for more advanced design, utilization, and maintenance of computers; examines and restructures the existing variety of mathematical models of complexity of algorithms and computation, introducing new models; possesses a comprehensive bibliography and index. The exposition of the book is motivated by numerous examples and illustrations. It serves to develop a new paradigm for complex, high-performance computing based on both partial recursive functions and more inclusive recursive algorithms.











This page was built for publication: Super-recursive algorithms.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3157968)