Descripción de contraportada
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.
Detalles
- Título Super-Recursive Algorithms
- Autor Mark Burgin
- Encuadernación Tapa dura
- Número de edición 2005th
- Edición 2005
- Páginas 304
- Volúmenes 1
- Idioma ENG
- Editorial Springer
- Fecha de publicación 2004-12-01
- Ilustrado Sí
- Features Bibliography, Illustrated, Index
- ISBN 9780387955698 / 0387955690
- Peso 1.32 libras (0.60 kg)
- Dimensiones 9.18 x 6.32 x 0.8 pulgadas (23.32 x 16.05 x 2.03 cm)
- Library of Congress subjects Algorithms, Recursive functions
- Número de catálogo de la Librería del Congreso de EEUU 2004041748
- Dewey Decimal Code 511.352
Más ejemplares
Super-Recursive Algorithms
de Burgin, Mark
- Usado
- Estado
- Used - Good
- ISBN 10 / ISBN 13
- 9780387955698 / 0387955690
- Cantidad disponible
- 1
- Librería
-
Reno, Nevada, United States
- Precio
-
EUR 31.34Envío gratuito a USA
Mostrar detalles
Super-Recursive Algorithms
de Burgin, Mark
- Usado
- Estado
- Used - Good
- ISBN 10 / ISBN 13
- 9780387955698 / 0387955690
- Cantidad disponible
- 1
- Librería
-
Mishawaka, Indiana, United States
- Precio
-
EUR 31.34Envío gratuito a USA
Mostrar detalles
Super-Recursive Algorithms
de Mark Burgin
- Usado
- good
- Tapa dura
- Estado
- Usado - Good
- Encuadernación
- Hardcover
- ISBN 10 / ISBN 13
- 9780387955698 / 0387955690
- Cantidad disponible
- 1
- Librería
-
Seattle, Washington, United States
- Precio
-
EUR 36.70Envío gratuito a USA
Mostrar detalles
SUPER-RECURSIVE ALGORITHMS (MONOGRAPHS IN COMPUTER SCIENCE)
de MARK BURGIN ,
- Nuevo
- Tapa dura
- First
- Estado
- New
- Edición
- 1st
- Encuadernación
- Hardcover
- ISBN 10 / ISBN 13
- 9780387955698 / 0387955690
- Cantidad disponible
- 4
- Librería
-
New Delhi, India
- Precio
-
EUR 75.40EUR 9.42 enviando a USA
Mostrar detalles
Super-Recursive Algorithms
de Mark Burgin
- Nuevo
- Tapa dura
- Estado
- New
- Encuadernación
- Hardcover
- ISBN 10 / ISBN 13
- 9780387955698 / 0387955690
- Cantidad disponible
- 693
- Librería
-
Uxbridge, Greater London, United Kingdom
- Precio
-
EUR 120.39EUR 9.46 enviando a USA
Mostrar detalles
Super-Recursive Algorithms (Monographs in Computer Science)
de Burgin, Mark
- Nuevo
- Tapa dura
- Estado
- New
- Encuadernación
- Hardcover
- ISBN 10 / ISBN 13
- 9780387955698 / 0387955690
- Cantidad disponible
- 1
- Librería
-
San Diego, California, United States
- Precio
-
EUR 107.41EUR 5.14 enviando a USA
Mostrar detalles
Super-Recursive Algorithms
de Mark Burgin
- Nuevo
- Tapa dura
- Estado
- New
- Encuadernación
- Hardcover
- ISBN 10 / ISBN 13
- 9780387955698 / 0387955690
- Cantidad disponible
- 4
- Librería
-
Woodside, New York, United States
- Precio
-
EUR 135.17EUR 3.76 enviando a USA
Mostrar detalles
Super Recursive Algorithms (Hb)
de Burgin M.
- Usado
- very good
- Estado
- Usado - Very Good
- ISBN 10 / ISBN 13
- 9780387955698 / 0387955690
- Cantidad disponible
- 1
- Librería
-
Indianapolis, Indiana, United States
- Precio
-
EUR 191.06EUR 11.92 enviando a USA
Mostrar detalles
Super-Recursive Algorithms (Monographs in Computer Science)
de Burgin, Mark
- Nuevo
- Tapa dura
- Estado
- New
- Encuadernación
- Hardcover
- ISBN 10 / ISBN 13
- 9780387955698 / 0387955690
- Cantidad disponible
- 5
- Librería
-
campbelltown, Florida, United States
- Precio
-
EUR 221.49EUR 14.14 enviando a USA
Mostrar detalles
Super-Recursive Algorithms (Hb)
de Burgin M.
- Nuevo
- Estado
- New
- ISBN 10 / ISBN 13
- 9780387955698 / 0387955690
- Cantidad disponible
- 500
- Librería
-
New Delhi, Andaman and Nicobar Islands, India
- Precio
-
EUR 309.94EUR 14.13 enviando a USA