This HTML version of Think Complexity, 2nd Edition is provided for convenience, but it is not the best format of the book. In particular, some of the symbols are not rendered correctly.

You might prefer to read the PDF version.

Index

1/f noise, 8.6
1-D cellular automaton, 5.1
1/f noise, 8.1
Anaconda, 0.3, 10.3
Appel, Kenneth, 1.2
Aristotelian logic, 1.5
Axelrod, Robert, 12.3
Axtell, Robert, 9.4
abstract model, 1, 3.8, 4.8, 5.9, 8.2
acceleration, 10.4
adaptation, 11.6, 11.7
agent, 1, 9.4, 11.1
agent-based model, 1, 9, 9.1
all pairs shortest path, 3.11
altruism, 12, 12.2, 12.8
analogy, 4.8, 8.8
analysis, 1.4
analysis of algorithms, 2.8
angle, 10.4
animal pattern, 7.2
arange, 12.5
arbitration, 10.4
argmax, 9.6
argument by analogy, 4.8, 5.9
artificial society, 9.4
avalanche, 8.2, 8.9
average clustering, 4.1
BA graph, 4.5
BA model, 4.7
Bak, Per, 7.7, 8.8
Barabási-Albert graph, 4.5
Bayesian, 1.5
BFS, 2.8, 3.9, 3.10, 3.11
The Big Sort, 9.9
Binder, 0.3
Bishop, Bill, 9.9
Boid, 10.3
background pattern, 5.13
beehive, 6.2
beetles, 5.8
behavior, 4.8
boolean, 2.7
boolean array, 6.6, 8.3, 8.5, 9.2, 11.5
bottom-up, 1.4
box-counting algorithm, 8.5
breadth-first search, 2.8, 3.9
brick wall, 9.8
broadcast service, 1.4
busy beaver, 5.13
CDF, 4.7, 8.10, 9.5
Cell1D, 5.10, 7.7
Cell1DViewer, 5.10
Cell2D, 8.3, 9.6
Cell2D class, 6.7
Cell2DViewer class, 6.7
Chinese Room argument, 9.9
Church-Turing thesis, 5.7
Class 3 behavior, 5.4
Class 4 behavior, 6.3
Class 4 cellular automaton, 5.7
The Computational Beauty of Nature, 10.3
Conway’s conjecture, 6.3
Conway, John H., 6.1
Cook, Matthew, 5.6
carrot, 10.4
causation, 5.5, 8.9, 9.1
cell, 5.7
cellular automaton, 5, 6.6, 8.2
centralized, 1.4
centroid, 10.4, 10.4
chaos, 5.5
characteristic path length, 3.6
choice, 3.4, 4.1, 7.3, 9.2, 11.5, 12.4
classifying cellular automatons, 5.3
client-server architecture, 1.4
clique, 3.2
clone, 0.3
cluster, 7.3, 9.1, 9.3
clustering, 3.2
clustering coefficient, 3.5, 4.5
collections module, 3.9
collision, 10.1
colormap, 5.10
compatibilism, 10.7
complete graph, 2.4
complex behavior, 5.5, 6.1, 6.7
complex model, 1.3
complex systems, 0
complexity science, 0, 1, 1.1
composite, 1.2
computable function, 5.7, 6
computation, 1.4
computational model, 1.1
computationally irreducible, 9.8
cone snail, 5.9
connected graph, 2.3, 2.5
consequence argument, 10.7
constant time, 2.8
constant-time algorithm, 9.8
continuous, 1.2
contributors, 0.3, 0.3
cooperate, 12.1
cooperation, 12.7
correlate, 5.11, 5.13
correlate2d, 6.6, 7.1, 9.2
cow, spherical, 1.2
criteria for models, 1.2
critical phenomena, 7.4
critical system, 8
critical value, 2.3, 2.7, 7.4, 7.6
criticality, 7.4
cross-correlation, 5.11, 6.6
cumulative distribution function, 4.7, 8.10, 9.5
Dawkins, Richard, 8.8
Detroit, 1
DFS, 3.9, 3.10
DieHarder, 5.13
Dijkstra’s algorithm, 3.10
Dijkstra, Edsger, 3.10
Driver, 10.1
decentralized, 1.4
defect, 12.1
degree, 3.3, 4.3
degree distribution, 4.3, 4.5
demarcation problem, 5.13
depth-first search, 3.9
deque, 3.9
design, 1.4
determinism, 1.5, 5.5, 10.6, 10.7
deterministic, 1.2, 5.1, 5.4
differential reproduction, 11.10
differential survival, 11.7, 12.6
diffusion, 7.1
digitize, 9.6
dimension, 7.5, 10
directed graph, 2.1
discrete, 1.2
distance, 11.9
distribution, 9.5
diversity, 11.6, 11.8
double-ended queue, 3.9
dtype, 4.1, 5.10, 6.6, 7.2
Eiffel Tower, 1.4
Eiffel, Gustave, 1.4
Epstein, Joshua, 9.4
Erdős, Paul, 2.3
Erdős-Rényi model, 2.3, 2.9
Evolution of Cooperation, 12.4
earthquake, 8.9
economic man, 1.2
economics, 1.2
edge, 2.1, 2.2
edge weight, 2.1
electrical power grid data, 4.5
electron, 6.5
ellipse, 3.8
emergence, 9.8, 10.6
emergent property, 9.8
engineering, 1.4
entropy, 5.5
epistemology, 1.5
equation-based model, 3.8
equilibrium, 11.8, 12.7
evolution, 8.8, 11
exclusive OR, 11.8, 11.9
explanatory model, 1.3, 3.8, 4.8
Facebook data, 4.1, 4.2
Flake, Gary William, 10.3
The Fractal Geometry of Nature, 8.10
Freud, Sigmund, 6.5
Fuzzy Thinking, 1.5
falsifiability, 5.8, 5.13
fireflies, 1.1
fitness, 9.5, 11.1
fitness landscape, 11.2
flicker noise, 8.6
flip, 2.6
float, 7.2
flock behavior, 10.5
floor division, 3.3
forest fire model, 7.7
forgiveness, 12.7
fork, 0.3
four-color theorem, 1.2
fractal, 7.5, 8.5, 8.10
fractal dimension, 7.5, 8.5, 8.5
fractal geometry, 8.1
free will, 1.5, 5.5, 10.6, 10.7
frequency, 8.6
frequentist, 1.5
fringe science, 1.1
Game of Life, 6.1, 8.10, 11.8
Game of Life patterns, 6.2
Gardner, Martin, 6.1
Gaussian distribution, 9.5
Gehry, Frank, 1.4
Git, 0.3
GitHub, 0.3
Gödel’s Incompleteness Theorem, 1.5
Goldstein, Rebecca, 1.5
Gosper, Bill, 6.3
Graph, 2.2
Great Man theory, 8.10
Guggenheim Museum Bilbao, 1.4
game theory, 12.1
gene, 6.4, 8.8
generative model, 3.2, 4.5
generator function, 2.4, 2.6, 3.3
genetics, 8.8
genotype, 11.1
glider, 6.2, 11.8
glider gun, 6.3
graph, 2.1
graph algorithm, 2.1, 2.8
graph layout, 2.1
graph theory, 2.1
grassroots, 1.4
gravitation, 1
grid, 6.1, 8.2, 9.1, 9.4, 10
growth, 4.5
Haken, Wolfgang, 1.2
Haldane, J. B. S., 5.8
Heraclitus, 6.4
Highlife, 6.7
Highway, 10.1
HK model, 4.9
Holme-Kim graph, 4.9
Homo economicus, 1.2
Hume, David, 10.6
hashable, 2.2
heavy-tailed distribution, 4.3, 8, 8.4, 8.9, 8.10, 9.5
highway, 10.1
holism, 1.3, 8.8, 8.10
holistic model, 8.8
homogeneous, 1.2
hop, 3.1
hub, 4.9
human nature, 12
hurricane, 6.4, 6.5
hypot, 9.6
Id, 6.5
Incompleteness, 1.5
Instrument, 11.6
ideal gas law, 8.8
imshow, 5.10
incompleteness, 1.5
indeterminism, 1.5
indices, 9.6
inequality, 9.4
instrumentalism, 1.3, 6.5
interaction, 1.4
island, 7.2
isolation, 1.4
itertools module, 8.3
James, William, 10.6
Jupyter, 0.2, 0.3
justification, 1
Kansas, 3.1
Kauffman, Stuart, 11.1
Kosko, Bart, 1.5
Kuhn, Thomas, 1.5, 1.5, 4.9
kernel, 6.6, 7.1, 7.3
Langton’s Ant, 6.7
Langton, Chris, 6.7
Laplace’s Demon, 5.5
Laplace, Pierre-Simon, 5.5
Life class, 6.7
LifeViewer class, 6.7
The Little Book of Semaphores, 3.10
lambda calculus, 5.7
linear, 1.2
linear congruential generator, 5.4
linear time, 2.8
linregress, 8.5
linspace, 10.1

list comprehension, 2.7, 4.1, 7.4
loadtext, 4.1
local connection, 3.1
local information, 10.3
log-log axis, 4.4
log-log scale, 8.5, 8.10
logarithm, 2.7, 4.4, 4.7, 8.6
logic, 1.5
lognormal distribution, 9.5
logspace, 2.7, 3.7
long tail, 8.1
Mandelbrot, Benoit, 8.10
Massachusetts, 3.1
McGrayne, Sharon Bertsch, 1.5
Methuselah, 6.3
Milgram, Stanley, 3.1
Moore neighborhood, 6.1
magnitude, 10.4, 10.4
maneuverability, 10.5
many-valued logic, 1.5
mathematical proof, 3.8, 4.8
mathematics, 5.9
mean, 2.7, 3.7, 7.4, 10.4, 12.7
melee, 12.5
meme, 8.8
migration, 9.7
minimum, 9.6
model, 1.5, 4.8
modeling, 1
modulus operator, 5.10
morphogenesis, 7.1
movie actor data, 4.5
mushroom, 6.5
mutation, 11.8
NaN, 3.5, 9.2
NetworkX, 0.1, 2.2, 3.9, 4.1, 4.5, 4.6
A New Kind of Science, 5.4, 5.7, 9.8
Newtonian mechanics, 5.5
Not a Number, 3.5, 9.2
NumPy, 0.1, 2.6, 2.7, 2.7, 3.4, 3.5, 3.7, 3.7, 4.1, 4.1, 5.10, 5.11, 5.12, 5.13, 6.6, 6.6, 7.2, 7.2, 7.3, 7.4, 8.3, 8.4, 8.5, 9.2, 9.2, 9.2, 9.3, 9.6, 9.6, 10.1, 10.1, 10.4, 11.2, 11.5, 11.6, 11.7, 11.8, 12.4, 12.5, 12.7
nanmean, 3.5, 9.3, 11.6
natural law, 1, 9.8
neighbor node, 2.5
neighborhood, 5.2, 6.1, 6.6, 7.3, 9.1
network average clustering coefficient, 3.5
node, 2.1, 2.2
noise, 8.6, 10.2
nondeterministic, 5.1
nonlinear, 1.2
nonzero, 9.2, 11.5
normal accident theory, 8.9
normal distribution, 9.5
objective, 1.5
objectivity, 4.9
observable, 4.8
one, two, many, 1.2
ones, 7.2
orbit, 3.8
order of growth, 2.8, 3.11
oscillator, 6.2
Perrow, Charles, 8.9
Pew Research Center, 11
PMF object, 4.3
Pmf, 8.4
Popper, Karl, 5.8, 5.13
PRNG, 5.4
Prisoner’s Dilemma, 12.1
Python, 0.1
pad, 5.13
parameter, 3.2, 10.7
parity, 5.10
path, 2.1, 2.5
path length, 3.2, 3.6
peer-to-peer architecture, 1.4
percolating cluster, 7.3
percolation, 7, 7.3, 7.6
performance error, 3.11
period, 5.4, 6.7
permutation, 9.6
perturbation, 8.2
phase change, 7.4
phenotype, 11.2
physical law, 1.5
physical model, 5.9
pink noise, 8, 8.1, 8.6
planetary motion, 1, 3.8
pop, 3.9
population pressure, 9.9
postulated entity, 6.4
power, 8.6
power law, 4.4, 8.1, 8.4
power spectrum, 8.6
prediction, 5.8, 8.9
predictive model, 1.3
preferential attachment, 4.5, 4.8
prevalence, 8.8
principle of computational equivalence, 5.7
probability mass function, 4.3
probability of connectivity, 2.7
problem of altruism, 12.2
proof, 1, 1.1, 3.8, 4.8
proof by induction, 3.10
proximate cause, 8.9
pseudo-random number generator, 5.4
pseudoscience, 1.1
puffer train, 6.3, 6.6
pyplot module, 5.10
quadratic, 2.8
quantum mechanics, 5.5
queue, 3.9
Rényi, Afréd, 2.3
Resnick, Mitchell, 10.1
Reynolds, Craig, 10.3
Rule 110, 5.6, 5.13, 9.7
Rule 18, 5.3, 7.5
Rule 20, 7.5
Rule 30, 5.4, 5.13
Rule 50, 5.2, 7.5
r-pentomino, 6.3
racism, 1, 9.1
radioactive decay, 5.5
randint, 6.6, 8.3, 9.2
random, 3.4, 4.1, 6.6, 7.2, 7.3, 8.3, 9.2, 9.2, 9.6, 9.6, 10.1, 11.2, 11.5, 11.7, 11.8, 12.4
random edge, 2.3
random graph, 2.3, 3.2
random module, 5.13
random walk, 7.4
randomness, 5.4
rational, 12.1
rational agent model, 12.2
reachable node, 2.5
reaction-diffusion, 7.2
reactive, 12.9
read-write head, 5.7, 6.7
realism, 1.3, 6.4
realistic model, 5.9
red noise, 8.6
reductionism, 1.3, 8.8, 8.10
register, 5.7
regular graph, 3.2, 3.3
replicator, 8.8, 11.10
repository, 0.3
representing graphs, 2.1
reproduction, 11, 11.1
retaliation, 12.7
rewire, 3.2, 3.4
rich get richer, 4.5
ring lattice, 3.3, 3.11
road network, 2.1
robust, 3.11
rule, 5.1
rule table, 5.2
SandPile, 8.3
Schelling’s model, 9.8
Schelling, Thomas, 1, 9.1
SciPy, 0.1, 6.6, 8.5, 8.7, 9.2
Searle, John, 9.9
The Selfish Gene, 8.8
Sharon, Massachusetts, 3.1
Sierpiński triangle, 5.3
SNAP, 4.1
SOC, 8, 8.1, 8.8, 8.10
Strogatz, Steven, 1.1, 3.2
The Structure of Scientific Revolutions, 1.5
Sugarscape, 9.4, 9.6
Superego, 6.5
Sync, 1.1
sampling frequency, 8.7
sand pile model, 8.2, 8.6, 8.8
scale-free network, 4.5
scaling, 7.5
scientific realism, 6.4
search, 1.4
segregation, 1, 1, 9.1, 9.3, 9.9
self-organized criticality, 8, 8.8, 8.10
self-similarity, 8.1
set, 2.5, 2.5
shortcut, 9.8
shortest path, 3.6, 3.10
shuffle, 9.6, 9.6
signal, 8.6
simple rules, 5.5, 6.7
simplification, 1
simulation, 11, 11.4, 12.6
simulation-based model, 3.8
single source sand pile, 8.10
single source shortest path, 3.10
six degrees, 3.1, 4.8
slice, 7.2
slice operator, 5.10
small world experiment, 3.1
small world network, 3.2
small world phenomenon, 3.11
small world property, 4.5
social network, 2.1, 3.1
social psychology, 12.2
space, 10
spaceship, 5.6, 5.13, 6.2, 9.7
special creation, 5.8
speciation, 11.9, 11.9
spherical cow, 1.2
stack, 2.5, 2.5, 3.9
state, 5.1, 5.2, 8.2
stationary, 9.5
stochastic, 1.2
stock market, 8.9
strategy, 12.4
strong AI, 9.9
subjective, 1.5
sufficiency theorem, 11.10
survival, 11, 11.1
synchronization, 1.1
system, 4.8
system reply, 9.9
TFT, 12.3, 12.4
The Theory That Would Not Die, 1.5
Turing complete, 5.6, 6, 6.1, 6.3
Turing machine, 5.7, 5.13, 6.7
Turing, Alan, 5.7, 6.7, 7.1
Turtles, Termites and Traffic Jams, 10.1
tape, 5.7
tautology, 5.7
theory, 1.5, 6.4
theory choice, 4.9
theory of evolution, 11
thinkplot module, 4.3, 4.7
thinkstats2 module, 8.4
time step, 5.1
tit for tat, 12.3
toad, 6.2
top-down, 1.4
toppling threshold, 8.3
tournament, 12.3, 12.5
traffic jam, 10.1
transpose, 8.4, 8.5
triangle of influence, 5.2
tuple, 9.2
turmite, 6.7
uint8, 5.10, 6.6
ultimate cause, 8.9
unbounded, 6.1
uncertainty, 1.5
undirected graph, 2.1
uniform, 10.1
universal, 6, 6.1
universal common descent, 5.8
universal gravitation, 3.8
universality, 5.6, 5.7, 6.3
unpackbits, 5.12
unstable, 8.1
Vector, 10.3
VPython, 10.3
variability, 11.10
velocity, 10.4
vertex, 2.1
vstack, 9.6
Watts, Duncan, 3.2
Watts-Strogatz graph, 3.4, 4.1, 4.2
Welch’s method, 8.7
Wichita, Kansas, 3.1
Wolfram, Stephen, 5, 9.8
WS model, 4.7
wave, 9.7
weak tie, 4.8, 4.9
wealth, 9.4
weight, 2.1
weighted sum, 10.5
where, 9.2, 11.2
white noise, 8.6
window, 5.11, 6.6
world-wide web data, 4.5
XOR, 11.8, 11.9
xenophobia, 1, 9.1
zeros, 5.10
zip, 4.6, 9.2, 12.4

Newer edition: the current edition of Think Complexity is free to read online.

If you find this book useful, please consider supporting free, open educational materials from Green Tea Press.

Modeling and Simulation in Python

Think Data Structures

Elements of Data Science