|
|
Sold Out
Book Categories |
| Foreword | ||
| Preface | ||
| Analyzing Integer Sequences | 1 | |
| GDR: A Visualization Tool for Graph Algorithms | 17 | |
| Application of Computational Tools for Finitely Presented Groups | 29 | |
| Animated Algorithms Computer Science Education with Algorithm Animation | 41 | |
| AGE: An Animated Graph Environment | 57 | |
| An Interactive, Graphical, Educationally Oriented Graph Analysis Package | 71 | |
| Network Assistant to Construct, Test, and Analyze Graph Network Algorithms | 75 | |
| Computing Spanning Trees in NETPAD | 85 | |
| An Empirical Assessment of Algorithms for Constructing a Minimum Spanning Tree | 99 | |
| Rectilinear Steiner Tree Minimization on a Workstation | 119 | |
| The XYZ GeoBench for the Experimental Evaluation of Geometric Algorithms | 137 | |
| Monitoring an Algorithm's Execution | 153 | |
| Implementation of Parallel Graph Algorithms on the MasPar | 165 | |
| Monte Carlo and Markov Chain Techniques for Network Reliability and Sampling | 199 | |
| Networks and Reliability in Maple | 223 | |
| GMP/X, Au X-Windows Based Graph Manipulation Package | 245 | |
| METANET: A System for Network Analysis | 255 | |
| GraphTool: A Tool for Interactive Design and Manipulation of Graphs and Graph Algorithms | 269 | |
| Improvements to GraphPack: A System to Manipulate Graphs and Digraphs | 279 | |
| Extending a Graph Browser for Topological Graph Theory | 297 | |
| Test Case Construction for the Vertex Cover Problem | 315 | |
| CallCo: Software for Combinatories | 327 | |
| Formal Calculus and Enumerative Combinatories | 335 | |
| Implementing Finite State Machines | 347 | |
| NPDA: A Tool for Visualizing and Simulating Nondeterministic Pushdown Automata | 365 | |
| Recognizing the Hidden Structure of Cayley Graphs | 379 | |
| A Concept for the Representation of Data and Algorithms | 391 |
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Oscar Wylde
reviewed Computational Support for Discrete Mathematics: DIMACS Workshop, March 12-14, 1992 on September 30, 2016
Computational Support for Discrete Mathematics
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
Computational Support for Discrete Mathematics: DIMACS Workshop, March 12-14, 1992
X
This Item is in Your Inventory
Computational Support for Discrete Mathematics: DIMACS Workshop, March 12-14, 1992
X
You must be logged in to review the productsX
X
X
Add Computational Support for Discrete Mathematics: DIMACS Workshop, March 12-14, 1992, With recent technological advances in workstations, graphics, graphical user interfaces, and object oriented programming languages, a significant number of researchers are developing general-purpose software and integrated software systems for domains in , Computational Support for Discrete Mathematics: DIMACS Workshop, March 12-14, 1992 to the inventory that you are selling on WonderClubX
X
Add Computational Support for Discrete Mathematics: DIMACS Workshop, March 12-14, 1992, With recent technological advances in workstations, graphics, graphical user interfaces, and object oriented programming languages, a significant number of researchers are developing general-purpose software and integrated software systems for domains in , Computational Support for Discrete Mathematics: DIMACS Workshop, March 12-14, 1992 to your collection on WonderClub |