ISBN: 9781441930606 - super-recursive algorithms (14 risultati)

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: New. pp. 318.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. This clear exposition, motivated by numerous examples and illustrations, serves researchers and advanced students interested in theory of computation and algorithms. …

Taschenbuch. Condizione: Neu. Super-Recursive Algorithms | Mark Burgin | Taschenbuch | Monographs in Computer Science | xii | Englisch | 2010 | Springer | EAN 9781441930606 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Condizione: New. In English.

Condizione: new. Questo è un articolo print on demand.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -\* The first exposition on super-recursive algorithms, systematizing all main classes and providingan accessible, focused examination of the theory and its ramifications\*Demonstrates how these algorithms are more appropriate as mathematical models for modern computers and how they present a better framework for computing methods\*Developsa new practically-oriented perspective on the theory of algorithms, computation, and automata, as a whole 316 pp. Englisch.…

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. * The first exposition on super-recursive algorithms, systematizing all main classes and providing&nbspan accessible, focused examination of the theory and its ramifications*&nbspDemonstrates how these algorithms are more appropriate as mathemat.…

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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. This clear exposition, motivated by numerous examples and illustrations, serves researchers and advanced students interested in theory of computation and algorithms.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 316 pp. Englisch. …

Condizione: New. Print on Demand pp. 318 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Condizione: New. PRINT ON DEMAND pp. 318.