Millions of books in English, Spanish and other languages. Free UK delivery 

menu

0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional
portada Algebraic Complexity Theory (Grundlehren der Mathematischen Wissenschaften)
Type
Physical Book
Publisher
Year
2010
Language
English
Pages
648
Format
Paperback
ISBN
3642082289
ISBN13
9783642082283

Algebraic Complexity Theory (Grundlehren der Mathematischen Wissenschaften)

Peter Burgisser; Michael Clausen; Mohammad A. Shokrollahi (Author) · Springer · Paperback

Algebraic Complexity Theory (Grundlehren der Mathematischen Wissenschaften) - Peter Burgisser; Michael Clausen; Mohammad A. Shokrollahi

New Book

£ 170.79

  • Condition: New
Origin: U.S.A. (Import costs included in the price)
It will be shipped from our warehouse between Thursday, July 18 and Thursday, July 25.
You will receive it anywhere in United Kingdom between 1 and 3 business days after shipment.

Synopsis "Algebraic Complexity Theory (Grundlehren der Mathematischen Wissenschaften)"

The algorithmic solution of problems has always been one of the major concerns of mathematics. For a long time such solutions were based on an intuitive notion of algorithm. It is only in this century that metamathematical problems have led to the intensive search for a precise and sufficiently general formalization of the notions of computability and algorithm. In the 1930s, a number of quite different concepts for this purpose were pro­ posed, such as Turing machines, WHILE-programs, recursive functions, Markov algorithms, and Thue systems. All these concepts turned out to be equivalent, a fact summarized in Church's thesis, which says that the resulting definitions form an adequate formalization of the intuitive notion of computability. This had and continues to have an enormous effect. First of all, with these notions it has been possible to prove that various problems are algorithmically unsolvable. Among of group these undecidable problems are the halting problem, the word problem theory, the Post correspondence problem, and Hilbert's tenth problem. Secondly, concepts like Turing machines and WHILE-programs had a strong influence on the development of the first computers and programming languages. In the era of digital computers, the question of finding efficient solutions to algorithmically solvable problems has become increasingly important. In addition, the fact that some problems can be solved very efficiently, while others seem to defy all attempts to find an efficient solution, has called for a deeper under­ standing of the intrinsic computational difficulty of problems.

Customers reviews

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

Frequently Asked Questions about the Book

All books in our catalog are Original.
The book is written in English.
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