Skip header Section
Skip Bibliometrics Section
Super-Recursive AlgorithmsDecember 2010
- Author:
- Mark Burgin
Skip Abstract Section
Abstract
* The first exposition on super-recursive algorithms, systematizing all main classes and providingan 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 *Developsa new practically-oriented perspective on the theory of algorithms, computation, and automata, as a whole
Cited By
Mikkilineni R, Morana G and Burgin M Oracles in Software Networks Proceedings of the 2015 European Conference on Software Architecture Workshops, (1-8)- Burgin M Super-recursive Algorithms and Modes of Computation Proceedings of the 2015 European Conference on Software Architecture Workshops, (1-5)
- Burgin M and Dodig-Crnkovic G A Taxonomy of Computation and Information Architecture Proceedings of the 2015 European Conference on Software Architecture Workshops, (1-8)
- Roglic D (2013). Ubiquity symposium: Evolutionary computation and the processes of life: towards synthesis of computational life-like processes of functional and evolvable proto-systems via extending evolutionary computation, Ubiquity, 2013:December, (1-11), Online publication date: 1-Dec-2013.
- Burgin M and Eberbach E (2013). Ubiquity symposium: Evolutionary computation and the processes of life: perspectives and reality of evolutionary computation, Ubiquity, 2013:December, (1-12), Online publication date: 1-Dec-2013.
- Burgin M and Eberbach E (2012). Ubiquity symposium: Evolutionary computation and the processes of life, Ubiquity, 2012:August, (1-13), Online publication date: 1-Aug-2012.
- Garzon M (2012). Ubiquity symposium: Evolutionary computation and the processes of life, Ubiquity, 2012:November, (1-16), Online publication date: 1-Nov-2012.
- Mo H (2012). Ubiquity symposium: Evolutionary computation and the processes of life, Ubiquity, 2012:November, (1-9), Online publication date: 1-Nov-2012.
- Hertel J Inductive complexity of goodstein's theorem Proceedings of the 11th international conference on Unconventional Computation and Natural Computation, (141-151)
- Calude C, Calude E and Queen M Inductive complexity of p versus NP problem Proceedings of the 11th international conference on Unconventional Computation and Natural Computation, (2-9)
- Dodig-Crnkovic G (2011). Significance of Models of Computation, from Turing Model to Natural Computation, Minds and Machines, 21:2, (301-322), Online publication date: 1-May-2011.
- Eberbach E (2008). Approximate reasoning in the algebra of bounded rational agents, International Journal of Approximate Reasoning, 49:2, (316-330), Online publication date: 1-Oct-2008.
- Ades M and Burgin M Evolutionary processes in modeling and simulation Proceedings of the 2007 spring simulation multiconference - Volume 3, (133-138)
- Davis M The church-turing thesis Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers, (125-132)
Recommendations
Super-recursive Algorithms and Modes of Computation
ECSAW '15: Proceedings of the 2015 European Conference on Software Architecture WorkshopsAccording to the contemporary computer science, working in the functional recursive mode, computers and computer networks function as recursive algorithms. At the same time, working in the functional super-recursive mode, such as inductive or limit ...