null Skip to main content

✨ Buy more, save 5% Ends

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

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

$20.09
New condition
(No reviews yet) Write a Review
Physical book delivery

Shipping calculated at checkout.

Estimated delivery
Adding to cart… The item has been added
Product Details
Author:
David a. Sprecher
Publisher:
Docent Press
Publication Date:
Jan 04, 2017
Number of pages:
276 pages
Language:
English
Binding:
Paperback
ISBN-10:
1942795963
ISBN-13:
9781942795964

Overview

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 this 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.


  • | Author: David a. Sprecher
  • | Publisher: Docent Press
  • | Publication Date: Jan 04, 2017
  • | Number of Pages: 276 pages
  • | Language: English
  • | Binding: Paperback
  • | ISBN-10: 1942795963
  • | ISBN-13: 9781942795964

Reviews

0 Reviews

Write a Review

No reviews yet.

Share your experience and help another reader choose their next book.

Discover your next great book

Get new releases, reader favourites, and special offers delivered to your inbox.