Algebraic Complexity Theory: 315 (Grundlehren der mathematischen Wissenschaften, 315) - Image 1

Price loading...

Springer Algebraic Complexity Theory: 315 (Grundlehren der mathematischen Wissenschaften, 315)

Name: Algebraic Complexity Theory: 315 (Grundlehren der mathematischen Wissenschaften, 315)
Brand: Springer

Algorithms

Price History & Forecast

No Price Data Available

Price history will appear here once data is collected from Amazon.

Price Distribution

No price data available for histogram

Description

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.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 3642082289
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Release Date: 05 December 2010
Listed Since: 05 September 2010

Barcode

No barcode data available

Springer Algebraic Complexity Theory: 315 (Grundlehren der mathematischen Wissenschaften, 315)

Price History & Forecast

No Price Data Available

Price Distribution

Description

Product Specifications

Barcode

Similar Products You Might Like

The Foundations of Computability Theory

Enumerability · Decidability Computability: An Introduction to the Theory of Recursive Functions: 127 (Grundlehren der mathematischen Wissenschaften, 127)

Language Computability and Formal Language Theory

Computability Theory: 26 (Chapman Hall/CRC Mathematics Series)

Turing Computability: Theory and Applications (Theory and Applications of Computability)

Springer Computational Invariant Theory: 130 Mathematics Book

Algorithmen - Eine Einführung

Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday (Texts & Monographs in Symbolic Computation)

Computability Theory and Its Applications: Current Trends and Open Problems (Contemporary Mathematics)

Theory of Computation: Automata, Formal Languages, Computation and Complexity

A Programming Approach to Computability (Monographs in Computer Science)

Springer - Algorithms for Computer Algebra Textbook

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Formal Languages and Computation: Models and Their Applications

Theory of Computation

Algorithmic Randomness and Complexity: 0 (Theory and Applications of Computability)

Effective Methods in Algebraic Geometry: 94 (Progress in Mathematics)

Reversibility and Universality: Essays Presented to Kenichi Morita on the Occasion of his 70th Birthday: 30 (Emergence, Complexity and Computation, 30)

Birkhauser Polynomial and Matrix Computations Textbook

Springer Computational Algebra and Number Theory - Mathematics 325

Advances in Unconventional Computing: Volume 1: Theory: 22 (Emergence, Complexity and Computation, 22)

Classical and New Paradigms of Computation and their Complexity Hierarchies: Papers of the conference "Foundations of the Formal Sciences III": 23 (Trends in Logic, 23)

Handbook of Computability and Complexity in Analysis (Theory and Applications of Computability)