عنوان

Computability theory /

شابک

082187392X

شابک

9780821873922

شماره

dltt

عنوان اصلي

Computability theory /

نام عام مواد

[Book]

نام نخستين پديدآور

Rebecca Weber

نام خاص و کميت اثر

vii, 203 pages :

ساير جزييات

illustrations ;

ابعاد

22 cm

عنوان فروست

Student mathematical library ;

مشخصه جلد

v. 62

متن يادداشت

Includes bibliographical references (pages 193-197) and index

متن يادداشت

"What can we compute--even with unlimited resources? Is everything within reach? Or are computations necessarily drastically limited, not just in practice, but theoretically? These questions are at the heart of computability theory. The goal of this book is to give the reader a firm grounding in the fundamentals of computability theory and an overview of currently active areas of research, such as reverse mathematics and algorithmic randomness. Turing machines and partial recursive functions are explored in detail, and vital tools and concepts including coding, uniformity, and diagonalization are described explicitly. From there the material continues with universal machines, the halting problem, parametrization and the recursion theorem, and thence to computability for sets, enumerability, and Turing reduction and degrees. A few more advanced topics round out the book before the chapter on areas of research. The text is designed to be self-contained, with an entire chapter of preliminary material including relations, recursion, induction, and logical and set notation and operators. That background, along with ample explanation, examples, exercises, and suggestions for further reading, make this book ideal for independent study or courses with few prerequisites."--Publisher description

موضوع مستند نشده

Computable functions

موضوع مستند نشده

Recursion theory

شماره

ويراست

شماره رده

نشانه اثر

مستند نام اشخاص تاييد نشده

Weber, Rebecca,1977-

تاريخ عمليات

20150223232753.0

نام الکترونيکي

نوع ماده

[Book]

تكميل شده

Y