Super-Recursive Algorithms

• Main Author: Burgin, Mark (Author)
• Corporate Author: SpringerLink (Online service)
• Format: Electronic eBook
• Language: English
• Published: New York, NY : Springer New York, 2005.
• Series: Monographs in Computer Science,
• Subjects: Mathematics.; Computers.; Algorithms.; Mathematical models.; Mathematical Modeling and Industrial Mathematics.; Algorithm Analysis and Problem Complexity.; Theory of Computation.

New discoveries about algorithms are leading scientists beyond the Church-Turing Thesis, which governs the "algorithmic universe" and asserts the conventionality of recursive algorithms. A new paradigm for computation, the super-recursive algorithm, offers promising prospects for algorithm...

Table of Contents:

• Recursive Algorithms
• Subrecursive Algorithms
• Superrecursive Algorithms: Problems of Computability
• Superrecursive Algorithms: Problems of Efficiency
• Conclusion: Problems of Information Technology and Computer Science Development.