|
|
Sold Out
Book Categories |
| 1 | Introduction | 1 |
| 2 | Subadditivity and Superadditivity | 9 |
| 3 | Subadditive and Superadditive Euclidean Functionals | 18 |
| 4 | Asymptotics for Euclidean Functionals: The Uniform Case | 32 |
| 5 | Rates of Convergence and Heuristics | 53 |
| 6 | Isoperimetry and Concentration Inequalities | 64 |
| 7 | Umbrella Theorems for Euclidean Functionals | 78 |
| 8 | Applications and Examples | 97 |
| 9 | Minimal Triangulations | 110 |
| 10 | Geometric Location Problems | 126 |
| 11 | Worst Case Growth Rates | 131 |
| Bibliography | 138 | |
| Index | 149 |
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Melanie Innes
reviewed Probability Theory of Classical Euclidean Optimization Problems, Vol. 167 on August 18, 2016
Probability Theory of Classical Euclidean Optimization Problems
I normally don't do this, but I'm going to copy/paste this review across three separate books: Chaitin's "The Unknowable", "The Limits of Mathematics", and "Exploring Randomness".
All three are all thin, overpriced, but very approachable books on Algorithmic Information Theory. Themes include:
- Undecidability, as the basis of formulating a new kind of randomness measure for numbers that have already been generated (not just restricting randomness measures to the processes that generate numbers).
- Chaitin's Omega constant, which is the probability that universal Turning machine will halt on random input. This constant is "maximally unknowable", but that doesn't stop one from performing math with it.
- Philosophy surrounding these topics.
One might underestimate Kolmogorov's contributions, given how ridiculously self-promoting Chaitin has been with this AIT. However, the topics are interesting enough that he's easy to forgive. And he uses many code demonstrations (LISP) to make concrete examples out of the math.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Probability Theory of Classical Euclidean Optimization Problems, Vol. 167
X
This Item is in Your Inventory
Probability Theory of Classical Euclidean Optimization Problems, Vol. 167
X
You must be logged in to review the productsX
X
X
Add Probability Theory of Classical Euclidean Optimization Problems, Vol. 167, This monograph describes the shastic behavior of the solutions to the classic problems of Euclidean combinatorial optimization, computational geometry, and operations research. Using two-sided additivity and isoperimetry, it formulates general methods des, Probability Theory of Classical Euclidean Optimization Problems, Vol. 167 to the inventory that you are selling on WonderClubX
X
Add Probability Theory of Classical Euclidean Optimization Problems, Vol. 167, This monograph describes the shastic behavior of the solutions to the classic problems of Euclidean combinatorial optimization, computational geometry, and operations research. Using two-sided additivity and isoperimetry, it formulates general methods des, Probability Theory of Classical Euclidean Optimization Problems, Vol. 167 to your collection on WonderClub |