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

David a Sprecher

ISBN 10: 1942795963 / ISBN 13: 9781942795964

Published by Docent Press, 2017

About this Item

This item is printed on demand. New copy - Usually dispatched within 5-9 working days 374.

Seller Inventory # C9781942795964

Bibliographic Details

• Title: From Algebra to Computational Algorithms: Kolmogorov and Hilbert's Problem 13
• Publisher: Docent Press
• Publication Date: 2017
• Language: English
• ISBN 10: 1942795963
• ISBN 13: 9781942795964
• Binding: Paperback / softback
• Condition: New

About this title

Synopsis

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.