Hausdorff Dimension

Real Analysis: Modern Techniques and Their Applications  eBooks & eLearning

Posted by tarantoga at Jan. 24, 2016
Real Analysis: Modern Techniques and Their Applications

Gerald B. Folland, "Real Analysis: Modern Techniques and Their Applications, 2nd Edition"
ISBN: 0471317160 | 1999 | EPUB | 416 pages | 6 MB

Real Analysis: Modern Techniques and Their Applications Ed 2  eBooks & eLearning

Posted by roxul at Sept. 8, 2021
Real Analysis: Modern Techniques and Their Applications Ed 2

Gerald B. Folland, "Real Analysis: Modern Techniques and Their Applications Ed 2"
English | ISBN: 0471317160 | 2007 | 416 pages | EPUB | 6 MB

Real Analysis: Modern Techniques and Their Applications (2nd edition)  eBooks & eLearning

Posted by ChrisRedfield at Aug. 29, 2014
Real Analysis: Modern Techniques and Their Applications (2nd edition)

Gerald B. Folland - Real Analysis: Modern Techniques and Their Applications (2nd edition)
Published: 1999-04-07 | ISBN: 0471317160 | PDF + DJVU | 408 pages | 12 MB

Algorithmic Randomness and Complexity (repost)  eBooks & eLearning

Posted by fdts at May 22, 2014
Algorithmic Randomness and Complexity (repost)

Algorithmic Randomness and Complexity
by Rodney G. Downey, Denis R. Hirschfeldt
English | 2010 | ISBN: 0387955674 | 855 pages | PDF | 5.70 MB

Asymptotic Behavior of Dissipative Systems  eBooks & eLearning

Posted by arundhati at June 14, 2014
Asymptotic Behavior of Dissipative Systems

Jack K. Hale, "Asymptotic Behavior of Dissipative Systems"
2010 | ISBN-10: 0821849344 | 198 pages | Djvu | 4 MB

Algorithmic Randomness and Complexity  eBooks & eLearning

Posted by AvaxGenius at March 15, 2020
Algorithmic Randomness and Complexity

Algorithmic Randomness and Complexity by Rodney G. Downey
English | PDF | 2010 | 883 Pages | ISBN : 0387955674 | 8.55 MB

Intuitively, a sequence such as 101010101010101010… does not seem random, whereas 101101011101010100…, obtained using coin tosses, does. How can we reconcile this intuition with the fact that both are statistically equally likely? What does it mean to say that an individual mathematical object such as a real number is random, or to say that one real is more random than another? And what is the relationship between randomness and computational power. The theory of algorithmic randomness uses tools from computability theory and algorithmic information theory to address questions such as these.

Algorithmic Randomness and Complexity  eBooks & eLearning

Posted by insetes at April 23, 2019
Algorithmic Randomness and Complexity

Algorithmic Randomness and Complexity By Rodney G. Downey, Denis R. Hirschfeldt (auth.)
2010 | 855 Pages | ISBN: 0387955674 | PDF | 6 MB

The Geometry of Random Fields (Repost)  eBooks & eLearning

Posted by DZ123 at Aug. 31, 2015
The Geometry of Random Fields (Repost)

Robert J. Adler, "The Geometry of Random Fields"
English | 1981 | ISBN: 0471278440 | DJVU | pages: 290 | 2,6 mb

The Geometry of Random Fields (Repost)  eBooks & eLearning

Posted by step778 at Sept. 3, 2013
The Geometry of Random Fields (Repost)

Robert J. Adler, "The Geometry of Random Fields"
1981 | pages: 290 | ISBN: 0471278440 | PDF | 9,8 mb

Continued Fractions  eBooks & eLearning

Posted by step778 at July 1, 2015
Continued Fractions

Doug Hensley, "Continued Fractions"
2006 | pages: 260 | ISBN: 9812564772 | PDF | 12,7 mb