Algebraic Complexity Theory
Algebraic Complexity Theory
Paperback
Couldn't load pickup availability
Join our rewards scheme and earn 258 reward points on this purchase!
Earn 258 points on this!
Sign in or Sign up!- Release Date: 05/12/2010
- Barcode: 9783642082283
- Edition: Softcover reprint of hardcover 1st ed. 1997
- Genre: Science Nature & Math
- Label: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
- Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
- Subgenre: Computing & Internet

Algebraic Complexity Theory
Softcover reprint of hardcover 1st ed. 1997
Couldn't load pickup availability
Collapsible content
DESCRIPTION
Among of group these undecidable problems are the halting problem, the word problem theory, the Post correspondence problem, and Hilbert's tenth problem. 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.
DELIVERY & RETURNS
UK Delivery:
- Free delivery on all orders of £10 or more.
- £1.49 delivery fee on orders below £10.
- UK orders are shipped via Royal Mail 2nd Class.
International Delivery:
- Flat rate delivery charges vary by country.
Dispatch and Delivery Times:
- All orders are shipped from our warehouse in Northampton, UK within 48 hours of receipt during working hours.
- UK mainland orders typically arrive within 3-5 working days via Royal Mail 2nd Class.
- International estimated delivery times:
- Europe & Channel Islands: 7 to 10 working days
- USA: 7 to 15 working days
- Rest of the World: 9 to 21 working days
View our full delivery infomation here.
-
OVER
2 MILLION PRODUCTS
-
60 MILLION CUSTOMERS
ACROSS 190 COUNTRIES
You might also like
Loading recommendations...