
This book introduces the new realm of superrecursive algorithms and the development
of mathematical models for them. Although many still believe that only recursive
algorithms exist and that only some of them are realizable, there are many
situations in which people actually work with superrecursive algorithms. Examples
of models for superrecursive algorithms are abstract automata like inductive Turing
machines as well as computational schemes like limiting recursive functions.
The newly emerging field of the theory of superrecursive algorithms belongs to
both mathematics and computer science. It gives a glimpse into the future of computers,
networks (such as the Internet), and other devices for information interchange,
processing, and production. In addition, superrecursive algorithms provide more adequate
models for modern computers, the Internet, and embedded systems. Consequently,
we hope (and expect) that this theory of superrecursive algorithms will, in
the end, provide new insight and different perspectives on the utilization of computers,
software, and the Internet.
The first goal of this book is to explain how superrecursive algorithms open
new kinds of possibilities for information technology. This is an urgent task. As Papadopoulos
(2002) writes, “If we don’t rethink the way we design computers, if we
don’t find new ways of reasoning about distributed systems, we may find ourselves
eating sand when the next wave hits.” We believe that a theory of superrecursive algorithms
makes it possible to introduce a new paradigm for computation, one that
yields better insight into future functioning of computers and networks. This form of
computation will eclipse the more familiar kinds and will be commercially available
before exotic technologies such as DNA and quantum computing arrive.
Another goal of this book is to explain how mathematics has explicated and evaluated
computational possibilities and its role in extending the boundaries of computation.
As we do this, we will present the theory of algorithms and computation in a
new, more organized structure.



Problems on Algorithms The ability to devise effective and efficient algorithms in new situations is a skill that separates the master programmer from the merely adequate coder. The best way to develop that skill is to solve problems. To be effective problem solvers, masterprogrammersintraining must do more than memorize a collection of...   Algorithms and Data Structures in C++ (Computer Engineering)
Algorithms and Data Structures in C++ introduces modern issues in the theory of algorithms, emphasizing complexity, graphs, parallel processing, and visualization. To accomplish this, the book uses an appropriate subset of frequently utilized and representative algorithms and applications in order to demonstrate the unique and modern aspects...   Encyclopedia of AlgorithmsThe Encyclopedia of Algorithms aims to provide the researchers, students, and practitioners of algorithmic research with a mechanism to efficiently and accurately find the names, definitions, key results, and further readings of important algorithmic problems.
The work covers a wide range of algorithmic areas, and each algorithmic area... 
Data Abstraction and Structures Using C++Data Abstraction and Stmctzwes Using C++ is designed for a second course in computer science fundamentals, consistent with the AChI guidelines for the CS2 course (August 1985). The book is also compatible with a Cl02 course in ACMAEEE’s Computing Curricula 1991, covering elements from the following knowledge units: ALl through AL4, AL6, SE1...   Data Structures and Their Algorithms
Like all engineering activities, computer programming is both craft and science. Building a bridge or a computer program requires familiarity with the known techniques for the overall design of similar artifacts. And making intelligent choices among the available techniques and designs requires understanding of the mathematical principles...   Data Structures and Algorithms in Java
This international student version of Data Structures and Algorithms in Java provides an introduction to data structures and algorithms, including their design, analysis, and implementation. In terms of curricula based on the IEEEIACM 2001 Computing Curriculum, this book is appropriate for use in the courses CS102 (1I01B versions), CS103... 
