Share
From Algebra to Computational Algorithms: Kolmogorov and Hilbert's Problem 13
David a. Sprecher
(Author)
·
Docent Press
· Paperback
From Algebra to Computational Algorithms: Kolmogorov and Hilbert's Problem 13 - David A Sprecher
Choose the list to add your product or create one New List
✓ Product added successfully to the Wishlist.
Go to My Wishlists
Origin: U.S.A.
(Import costs included in the price)
It will be shipped from our warehouse between
Friday, June 28 and
Wednesday, July 10.
You will receive it anywhere in United Kingdom between 1 and 3 business days after shipment.
Synopsis "From Algebra to Computational Algorithms: Kolmogorov and Hilbert's Problem 13"
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.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.
✓ Producto agregado correctamente al carro, Ir a Pagar.
