Handbook of Data Structures and Applications responds to the needs of data structure and algorithm researchers by providing a comprehensive survey of data structures of various types. Divided into seven parts, the text begins with a review of introductory material, followed by a discussion of well-know classes of data structures, Priority...
Computability and complexity theory should be of central concern to practitioners as well as theorists. Unfortunately, however, the field is known for its impenetrability. Neil Jones's goal as an educator and author is to build a bridge between computability and complexity theory and other areas of computer science, especially programming. In a...
Part of what it means to be a researcher is to identify what appears to be a relationship that others either have not noticed or have not fully appreciated. Both the Turing test and the frame problem have been significant items of discussion for more than 20 years in the philosophy of artificial intelligence and the philosophy of mind, but there...
This book is inspired by boredom and fascination: boredom with the usual presentation of data structures and algorithms, and fascination with complex
systems. The problem with data structures is that they are often taught without a motivating context; the problem with complexity science is that it is
usually not taught at...
This book deals with computer viruses envisaged from three different points of view, namely the theoretical fundamentals of computer virology, algorithmic and practical aspects of viruses and their potential applications to various areas. The theoretical formalization by means of Turing machines, self-reproducing automata and recursive functions...
Intended for graduate students and advanced undergraduates in computer science, A Second Course in Formal Languages and Automata Theory treats topics in the theory of computation not usually covered in a first course. After a review of basic concepts, the book covers combinatorics on words, regular languages, context-free languages, parsing and...
Before digital computers ever existed, Alan Turing envisioned their power and versatility...but also proved what computers could never do.
In an extraordinary and ultimately tragic life that unfolded like a novel, Turing helped break the German Enigma code to turn the tide of World War II, later speculated on...
This comprehensive discussion of the components of a programming language emphasises how a language is built. It covers core concepts including specification, objects, expressions, control and types with discussions of fundamentals, implementations strategies and related semantic issues. The book also focuses on current topics such as modules and...
A History of Mathematics covers the evolution of mathematics through time and across the major Eastern and Western civilizations. It begins in Babylon, then describes the trials and tribulations of the Greek mathematicians. The important, and often neglected, influence of both Chinese and Islamic mathematics is covered in detail,...
Alan Turing was one of the most important and influential thinkers of the 20th century. This volume makes his key writings available to a non-specialist readership for the first time. They make fascinating reading both in their own right and for their historic significance: contemporary computational theory, cognitive science, and artificial...
RSA is the first workable and practicable public-key cryptographic system, based on the use of large prime numbers. It is also the most popular and widely-used cryptographic system in today's digital world, for which its three inventors Rivest, Shamir and Adleman received the year 2002 Turing Award, the equivalent Nobel Prize in Computer Science....
The study of the class of computable partial functions (i.e., recursive partial functions)
stands at the intersection of three fields: mathematics, theoretical computer science,
and philosophy.
Mathematically, computability theory originates from the concept of an algorithm.
It leads to a classification of functions according...