Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Rome --- History --- -870 --- 870.9001 --- 870 --- Literature Latin ( - 500) --- Literature Latin --- Classical Latin literature --- Rome - History - Kings, 753-510 BC --- Rome - History - To 510 BC --- Histoire --- Jusqu'à 510 av. J.-C.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Logic, symbolic and mathematical --- Logic --- 510.6 --- 510.6 Mathematical logic --- Mathematical logic --- Logic, Symbolic and mathematical --- Logique mathématique. --- Algebraic logic --- Logique algébrique. --- Algebra --- Algèbre. --- Logique mathématique --- Logique mathématique. --- Logique algébrique. --- Algèbre.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

631.474 --- <510> --- Land classification and utilization --- China --- Geography --- Land use --- Natural resources --- Soils --- Cosmography --- Earth sciences --- World history

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Rome --- Study and teaching (Secondary) --- -Rome --- Rim --- Roman Empire --- Roman Republic (510-30 B.C.) --- Romi (Empire) --- Byzantine Empire --- Rome (Italy) --- Rome - Study and teaching (Secondary) - Germany

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

What can computers do in principle? What are their inherent theoretical limitations? These are questions to which computer scientists must address themselves. The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function: intuitively a function whose values can be calculated in an effective or automatic way. This book is an introduction to computability theory (or recursion theory as it is traditionally known to mathematicians). Dr Cutland begins with a mathematical characterisation of computable functions using a simple idealised computer (a register machine); after some comparison with other characterisations, he develops the mathematical theory, including a full discussion of non-computability and undecidability, and the theory of recursive and recursively enumerable sets. The later chapters provide an introduction to more advanced topics such as Gildel's incompleteness theorem, degrees of unsolvability, the Recursion theorems and the theory of complexity of computation. Computability is thus a branch of mathematics which is of relevance also to computer scientists and philosophers. Mathematics students with no prior knowledge of the subject and computer science students who wish to supplement their practical expertise with some theoretical background will find this book of use and interest.

Computable functions --- Recursion theory --- Fonctions calculables --- Théorie de la récursivité --- #TCPW W1.2 --- Computability theory --- Functions, Computable --- Partial recursive functions --- Recursive functions, Partial --- Decidability (Mathematical logic) --- Computable functions. --- #TCPW P3.0 --- 510.5 --- Logic, Symbolic and mathematical --- Constructive mathematics --- 510.5 Algorithms. Computable functions --- Algorithms. Computable functions --- Programming --- Mathematical logic --- Recursion theory. --- Logique mathématique --- Récursivité, Théorie de la --- Logique mathematique --- Algorithmes --- Calculabilite --- Fonctions recursives --- Complexite