Del 315 i serien Grundlehren der mathematischen Wissenschaften
Algebraic Complexity Theory
Häftad, Engelska, 2010
2 009 kr
Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.
Finns i fler format (1)
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.
Produktinformation
- Utgivningsdatum2010-12-05
- Mått155 x 235 x 40 mm
- Vikt976 g
- FormatHäftad
- SpråkEngelska
- SerieGrundlehren der mathematischen Wissenschaften
- Antal sidor618
- FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
- ISBN9783642082283
Tillhör följande kategorier
Hoppa över listan
Mer från samma serie
Del 291
Del 291
Markov Processes, Brownian Motion, and Time Symmetry
Kai Lai Chung, John B. Walsh
Inbunden, 2005
1 719 kr
Del 290
Del 244
Del 252
Del 255
Del 259
Del 267
Geometry of Algebraic Curves
Enrico Arbarello, Maurizio Cornalba, Phillip Griffiths, Joseph Daniel Harris
Inbunden, 1984
1 439 kr
Del 115
Hoppa över listan
Du kanske också är intresserad av
Del 315
Algebraic Complexity Theory
Peter Bürgisser, Michael Clausen, Mohammad A. Shokrollahi
Inbunden, 1996
2 009 kr
Applicable Algebra, Error-Correcting Codes, Combinatorics and Computer Algebra
Thomas Beth, Michael Clausen
Häftad, 1988
739 kr
Del 349
Del 349
- Nyhet
Del 3
- Nyhet
Del 11
- Nyhet
Del 4
- Nyhet
Del 6