|
|
Sold Out
Book Categories |
| Statistical Mechanics of Cellular Automata | 3 | |
| Algebraic Properties of Cellular Automata | 71 | |
| Universality and Complexity in Cellular Automata | 115 | |
| Computation Theory of Cellular Automata | 159 | |
| Undecidability and Intractability in Theoretical Physics | 203 | |
| Two-Dimensional Cellular Automata | 211 | |
| Origins of Randomness in Physical Systems | 251 | |
| Thermodynamics and Hydrodynamics of Cellular Automata | 259 | |
| Random Sequence Generation by Cellular Automata | 267 | |
| Approaches to Complexity Engineering | 309 | |
| Minimal Cellular Automaton Approximations to Continuum Systems | 329 | |
| Cellular Automaton Fluids: Basic Theory | 359 | |
| Cellular Automata | 411 | |
| Computers in Science and Mathematics | 439 | |
| Geometry of Binomial Coefficients | 451 | |
| Twenty Problems in the Theory of Cellular Automata | 457 | |
| Cryptography with Cellular Automata | 487 | |
| Complex Systems Theory | 491 | |
| Cellular Automaton Supercomputing | 499 | |
| Tables of Cellular Automaton Properties | 513 | |
| Scientific Bibliography of Stephen Wolfram | 585 | |
| Index | 591 |
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Nicholas Phariss
reviewed Cellular Automata And Complexity on January 08, 2017
Cellular Automata And Complexity
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
Cellular Automata And Complexity
X
This Item is in Your Inventory
Cellular Automata And Complexity
X
You must be logged in to review the productsX
X
X
Add Cellular Automata And Complexity, Are mathematical equations the best way to model nature? For many years it had been assumed that they were. But in the early 1980s, Stephen Wolfram made the radical proposal that one should instead build models that are based directly on simple computer p, Cellular Automata And Complexity to the inventory that you are selling on WonderClubX
X
Add Cellular Automata And Complexity, Are mathematical equations the best way to model nature? For many years it had been assumed that they were. But in the early 1980s, Stephen Wolfram made the radical proposal that one should instead build models that are based directly on simple computer p, Cellular Automata And Complexity to your collection on WonderClub |
