This book offers a comprehensive treatment of the classical decision problem of mathematical logic and of the role of the classical decision problem in modern computer science. The text presents a revealing analysis of the natural order of decidable and undecidable cases and includes a number of simple proofs and exercises.

Traces the development of recursive functions from their origins in the late nineteenth century to the mid-1930s, with particular emphasis on the work and influence of Kurt Gödel.

The Emergent Multiverse presents a striking new account of the 'many worlds' approach to quantum theory. The point of science, it is generally accepted, is to tell us how the world works and what it is like. But quantum theory seems to fail to do this: taken literally as a theory of the world, it seems to make crazy claims: particles are in two places at once; cats are alive and dead at the same time. So physicists and philosophers have often been led either to give up on the idea that quantum theory describes reality, or to modify or augment the theory. The Everett interpretation of quantum mechanics takes the apparent craziness seriously, and asks, 'what would it be like if particles really were in two places at once, if cats really were alive and dead at the same time'? The answer, it turns out, is that if the world were like that—if it were as quantum theory claims—it would be a world that, at the macroscopic level, was constantly branching into copies—hence the more sensationalist name for the Everett interpretation, the 'many worlds theory'. But really, the interpretation is not sensationalist at all: it simply takes quantum theory seriously, literally, as a description of the world. Once dismissed as absurd, it is now accepted by many physicists as the best way to make coherent sense of quantum theory. David Wallace offers a clear and up-to-date survey of work on the Everett interpretation in physics and in philosophy of science, and at the same time provides a self-contained and thoroughly modern account of it—an account which is accessible to readers who have previously studied quantum theory at undergraduate level, and which will shape the future direction of research by leading experts in the field.

In conventional mathematical programming, coefficients of problems are usually determined by the experts as crisp values in terms of classical mathematical reasoning. But in reality, in an imprecise and uncertain environment, it will be utmost unrealistic to assume that the knowledge and representation of an expert can come in a precise way. The wider objective of the book is to study different real decision situations where problems are defined in inexact environment. Inexactness are mainly generated in two ways – (1) due to imprecise perception and knowledge of the human expert followed by vague representation of knowledge as a DM; (2) due to huge-ness and complexity of relations and data structure in the definition of the problem situation. We use interval numbers to specify inexact or imprecise or uncertain data. Consequently, the study of a decision problem requires answering the following initial questions: How should we compare and define preference ordering between two intervals?, interpret and deal inequality relations involving interval coefficients?, interpret and make way towards the goal of the decision problem? The present research work consists of two closely related fields: approaches towards defining a generalized preference ordering scheme for interval attributes and approaches to deal with some issues having application potential in many areas of decision making.

Foundations of Information Technology in the Era of Network and Mobile Computing is presented in two distinct but interrelated tracks: -Algorithms, Complexity and Models of Computation; -Logic, Semantics, Specification and Verification. This volume contains 45 original and significant contributions addressing these foundational questions, as well as 4 papers by outstanding invited speakers. These papers were presented at the 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), which was held in conjunction with the 17th World Computer Congress, sponsored by the International Federation for Information Processing (IFIP), and which convened in Montréal, Québec, Canada in August 2002.

This book constitutes the refereed proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, STACS 97, held in Lübeck, Germany, in February/March 1997. The 46 revised full papers included were carefully selected from a total of 139 submissions; also included are three invited full papers. The papers presented span the whole scope of theoretical computer science. Among the topics covered are, in particular, algorithms and data structures, computational complexity, automata and formal languages, structural complexity, parallel and distributed systems, parallel algorithms, semantics, specification and verification, logic, computational geometry, cryptography, learning and inductive inference.