Mark Burgin 
Super-Recursive Algorithms [PDF ebook] 

Supporto

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.

€96.29
Modalità di pagamento

Tabella dei contenuti

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

Circa l’autore

 Burgin published extensively on this new theoretical topic. Based on UCLA lectures, articles, invited ACM Communications Survey article (11/01), and invited High Performance Computing Symposium presentation.

Acquista questo ebook e ricevine 1 in più GRATIS!
Lingua Inglese ● Formato PDF ● Pagine 304 ● ISBN 9780387268064 ● Dimensione 2.5 MB ● Casa editrice Springer New York ● Città NY ● Paese US ● Pubblicato 2006 ● Scaricabile 24 mesi ● Moneta EUR ● ID 2144287 ● Protezione dalla copia DRM sociale

Altri ebook dello stesso autore / Editore

4.019 Ebook in questa categoria