Super-Recursive Algorithms

• Κύριος συγγραφέας: Burgin, Mark (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: New York, NY : Springer New York, 2005.
• Σειρά: Monographs in Computer Science,
• Θέματα: 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...

Πίνακας περιεχομένων:

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