Super-Recursive Algorithms

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...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριος συγγραφέας: Burgin, Mark (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: New York, NY : Springer New York, 2005.
Σειρά:Monographs in Computer Science,
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04248nam a22005055i 4500
001 978-0-387-26806-4
003 DE-He213
005 20151204183840.0
007 cr nn 008mamaa
008 100301s2005 xxu| s |||| 0|eng d
020 |a 9780387268064  |9 978-0-387-26806-4 
024 7 |a 10.1007/b138114  |2 doi 
040 |d GrThAP 
050 4 |a TA342-343 
072 7 |a PBWH  |2 bicssc 
072 7 |a TBJ  |2 bicssc 
072 7 |a MAT003000  |2 bisacsh 
072 7 |a TEC009060  |2 bisacsh 
082 0 4 |a 003.3  |2 23 
100 1 |a Burgin, Mark.  |e author. 
245 1 0 |a Super-Recursive Algorithms  |h [electronic resource] /  |c by Mark Burgin. 
264 1 |a New York, NY :  |b Springer New York,  |c 2005. 
300 |a XII, 304 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Monographs in Computer Science,  |x 0172-603X 
505 0 |a Recursive Algorithms -- Subrecursive Algorithms -- Superrecursive Algorithms: Problems of Computability -- Superrecursive Algorithms: Problems of Efficiency -- Conclusion: Problems of Information Technology and Computer Science Development. 
520 |a 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 algorithms of much greater computing power and efficiency. Super-Recursive Algorithms provides an accessible, focused 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. Topics and Features: * Encompasses and systematizes all main classes of super-recursive algorithms and the theory behind them * 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 * Encompasses and systematizes all main types of mathematical models of algorithms * 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 This clear exposition, motivated by numerous examples and illustrations, serves to develop a new paradigm for complex, high-performance computing based on both partial recursive functions and more inclusive recursive algorithms. Researchers and advanced students interested in theory of computation and algorithms will find the book an essential resource for an important new class of algorithms. 
650 0 |a Mathematics. 
650 0 |a Computers. 
650 0 |a Algorithms. 
650 0 |a Mathematical models. 
650 1 4 |a Mathematics. 
650 2 4 |a Mathematical Modeling and Industrial Mathematics. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Theory of Computation. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9780387955698 
830 0 |a Monographs in Computer Science,  |x 0172-603X 
856 4 0 |u http://dx.doi.org/10.1007/b138114  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
950 |a Computer Science (Springer-11645)