Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
From Algebra to Computational Algorithms: Kolmogorov and Hilbert's Problem 13

From Algebra to Computational Algorithms: Kolmogorov and Hilbert's Problem 13

Sprecher, David a.

Paperback

General Mathematics

ISBN10: 1942795963
ISBN13: 9781942795964
Publisher: Docent Pr
Published: Jan 4 2017
Pages: 276
Weight: 0.82
Height: 0.58 Width: 6.00 Depth: 9.00
Language: English
Problem 13 of Hilbert's famous twenty-three is the most easily understood of the collection. The truth of Hilbert's conjecture concerning the resolution of his problem was intuitively pleasing and widely-held: roughly stated, the number of variables in an equation is a measure of the complexity of the equation. In 1957 a nineteen year old student of Andrey Kolmogorov, Vladimir Arnold, proved that two variables suffice. That is, any function of more than two variables can be recast as a function of only two variables. From Algebra to Computational Algorithms recounts the history of Problem 13, elucidates Arnold's surprising result, and explores some of the applications of the result to problems in computer science.

Also in

General Mathematics

View All