MARC Record from harvard_bibliographic_metadata

LEADER: 03981nam a22004695a 4500
001 014277492-8
005 20150113020620.0
008 100301s2005 xxu| s ||0| 0|eng d
020 $a9780387268064
020 $a9780387268064
020 $a9780387955698
024 7 $a10.1007/b138114$2doi
035 $a(Springer)9780387268064
040 $aSpringer
050 4 $aQA76.9.A43
072 7 $aUMB$2bicssc
072 7 $aCOM051300$2bisacsh
082 04 $a005.1$223
100 1 $aBurgin, Mark.$eauthor.
245 10 $aSuper-Recursive Algorithms /$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.
520 $aProblems 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.
520 $aTopics 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,
520 $ahigh-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 $aComputer science.
650 0 $aInformation theory.
650 0 $aComputer software.
650 14 $aComputer Science.
650 24 $aAlgorithm Analysis and Problem Complexity.
650 24 $aTheory of Computation.
776 08 $iPrinted edition:$z9780387955698
830 0 $aMonographs in Computer Science,$x0172-603X
988 $a20150113
906 $0VEN