000 04231nam a22005055i 4500
001 978-0-387-26806-4
003 DE-He213
005 20161121230516.0
007 cr nn 008mamaa
008 100301s2005 xxu| s |||| 0|eng d
020 _a9780387268064
_9978-0-387-26806-4
024 7 _a10.1007/b138114
_2doi
050 4 _aTA342-343
072 7 _aPBWH
_2bicssc
072 7 _aTBJ
_2bicssc
072 7 _aMAT003000
_2bisacsh
072 7 _aTEC009060
_2bisacsh
082 0 4 _a003.3
_223
100 1 _aBurgin, Mark.
_eauthor.
245 1 0 _aSuper-Recursive Algorithms
_h[electronic resource] /
_cby Mark Burgin.
264 1 _aNew York, NY :
_bSpringer New York,
_c2005.
300 _aXII, 304 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aMonographs in Computer Science,
_x0172-603X
505 0 _aRecursive Algorithms -- Subrecursive Algorithms -- Superrecursive Algorithms: Problems of Computability -- Superrecursive Algorithms: Problems of Efficiency -- Conclusion: Problems of Information Technology and Computer Science Development.
520 _aNew 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 _aMathematics.
650 0 _aComputers.
650 0 _aAlgorithms.
650 0 _aMathematical models.
650 1 4 _aMathematics.
650 2 4 _aMathematical Modeling and Industrial Mathematics.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aTheory of Computation.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9780387955698
830 0 _aMonographs in Computer Science,
_x0172-603X
856 4 0 _uhttp://dx.doi.org/10.1007/b138114
912 _aZDB-2-SCS
950 _aComputer Science (Springer-11645)
999 _c499828
_d499828