Hallo! Tracked shipping to Netherlands with Delivery Duty Paid for just €7 

Ship to
Netherlands
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada Tourlakis: Computability
Type
Physical Book
Publisher
Author
Language
English
Pages
637
Format
Paperback
ISBN13
9783030832049

Tourlakis: Computability

Tourlakis, George (Author) · Springer Verlag Gmbh · Paperback

Tourlakis: Computability - Tourlakis, George

Cheaper New Book Imported to Netherlands
Delivery: 02 Sep - 09 Sep Shipping: 12 to 16 business days.
€ 66,30
Faster New Book Imported to Netherlands
Delivery: 20 Aug - 24 Aug Shipping: 4 to 5 business days.
€ 83,65
Import costs and 9% BTW included in the price ✅
€ 66,30

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "Tourlakis: Computability "

This survey of computability theory offers the techniques and tools that computer scientists (as well as mathematicians and philosophers studying the mathematical foundations of computing) need to mathematically analyze computational processes and investigate the theoretical limitations of computing. Beginning with an introduction to the mathematisation of "mechanical process" using URM programs, this textbook explains basic theory such as primitive recursive functions and predicates and sequence-coding, partial recursive functions and predicates, and loop programs. Advanced chapters cover the Ackerman function, Tarski's theorem on the non-representability of truth, Goedel's incompleteness and Rosser's incompleteness theorems, two short proofs of the incompleteness theorem that are based on Lob's deliverability conditions, Church's thesis, the second recursion theorem and applications, a provably recursive universal function for the primitive recursive functions, Oracle computations and various classes of computable functionals, the Arithmetical hierarchy, Turing reducibility and Turing degrees and the priority method, a thorough exposition of various versions of the first recursive theorem, Blum's complexity, Hierarchies of primitive recursive functions, and a machine-independent characterisation of Cobham's feasibly computable functions.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews