E-Book (PDF mit drm)
280 Seiten
Sprache English
2018 Princeton University Press
ISBN 978-0-691-18833-1
280 Seiten
Sprache English
2018 Princeton University Press
ISBN 978-0-691-18833-1
- Accuracy and precision
- Adjacency list
- Adjacency matrix
- Algorithm
- Almost surely
- Approximation
- Attractor
- Automaton
- Big O notation
- Binomial distribution
- Calculation
- Cellular automaton
- Closed-form expression
- Cluster analysis
- Cluster graph
- Complete graph
- Complexity
- Computation
- Computational problem
- Computer terminal
- Conjecture
- Connectedness
- Connectivity (graph theory)
- Diagram (category theory)
- Diameter
- Dimension
- Dynamical system
- Emergence
- Equation
- Euclidean space
- Expected value
- Explanation
- Fermat's Last Theorem
- Free parameter
- High- and low-level
- Initial condition
- Logical connective
- Mathematical optimization
- Metric space
- Moore graph
- Non-Euclidean geometry
- Normal distribution
- Order of magnitude
- Order of operations
- Parameter
- Path length
- Percolation threshold
- Phase transition
- Prisoner's dilemma
- Probability
- Probability distribution
- Quantity
- Random graph
- Result
- Sampling (statistics)
- Schematic
- Scientific notation
- Search tree
- Small-world network
- Sparse network
- Special case
- Statistic
- Statistical population
- Stochastic
- Theory
- Triangle inequality
- Turing machine
- Two-dimensional space
- Uniform distribution (discrete)
- Upper and lower bounds