Index

+= operator, 3.5
1-D cellular automaton, 6.1
1/f noise, 9.1, 9.4, 9.6
2-D cellular automaton, 9.1
80/20 rule, 5.4
Appel, Kenneth, 1.4
Aristotelian logic, 1.7
Axelrod, Robert, 10.5
abstract class, 6.3
abstract model, 1.2, 4.6, 5.7, 6.10, 9.1
agent, 1.2
agent-based model, 1.2, 10.1, 10.2
algorithm, 1.1, 3
all pairs shortest path, 4.5
amphetamine, 2.5
analogy, 5.7, 9.5
analysis, 1.6
analysis of algorithms, 3
analysis of graph algorithms, 4.1
analysis of primitives, 3.2
angular frequency, 9.2
animation, 7.1
applying graph algorithm, 2.1
argument by analogy, 5.7, 6.10
array, 6.2
array indexing, 6.2
array slice, 6.2
asymptotic analysis, 3
avalanche, 8.2, 9.1
average case, 3
average cost, 3.4
Bak, Per, 8.1, 9.1, 9.5
Barabási-Albert model, 5.5
Bayesian, 1.7
BetterMap, 3.4
BFS, 2.4, 4.1, 4.5
The Big Sort, 10.1
Bishop, Bill, 10.1
badness, 3.1
becquerel, 2.1
beetles, 6.9
behavior, 5.7
big-oh notation, 3.1
bin size, 5.2
bisect module, 3.3
bisect module, 3.3
bisection search, 3.3
boid, 10.4
bond percolation, 8.2
bottom-up, 1.6
bounded, 3.4
box-counting dimension, 8
breadth first search, 4.1
breadth-first search, 2.4, 4.5
brick wall, 10.6
broadcast service, 1.6
bubble sort, 3
busy beaver, 6.8
CA, 6.2
CADrawer, 6.3
CDF, 5.2
Cdf, 5.2
Church-Turing thesis, 6.8
CircularCA, 6.3
Class 3 behavior, 6.5
Class 4 behavior, 6.8, 7.3
Conway, John H., 7
Cook, Matthew, 6.7
caffeine, 2.5
canonical ensemble, 8.2
carrot, 10.4
causation, 6.6, 9.6, 10.1
cell, 6.8
cellular automaton, 6
centralized, 1.6
chaos, 6.6
circular buffer, 4.2
classifying cellular automata, 6.4
client-server architecture, 1.6
clique, 4.4
clustering, 4.4
clustering coefficient, 4.4
color map, 7.1
comparing algorithms, 3
comparison sort, 3.2
complementary CDF, 5.6
complementary distribution, 5.3
complete graph, 2.1
complex, 9.2
complex behavior, 6.6, 7, 7.6
complex model, 1.5
complex systems, 1.1
complexity science, 1.1, 1.1, 1.3
composite, 1.4
computable function, 6.8
computation, 1.6
computational model, 1.3
computationally irreducible, 10.6
conception, 7.4
cone snail, 6.10
connected graph, 2.1, 2.4
constant time, 3.4, 4.1
continuous, 1.4
continuous distribution, 5.3
contributors, 0.3, 0.3
convolution, 7.1
cow, spherical, 1.4
criteria for models, 1.4
critical value, 2.5, 8.2
criticality, 9.1
crossover point, 3.1
cube, 8
cumulative distribution, 5.2
cumulative distribution function, 5.2
cycle, 2.1
Danielson-Lanczos Lemma, 9.3
Dawkins, Richard, 9.5
Detroit, 1.2
DFT, 9.2
DictFifo, 4.2
DieHarder, 6.5
Dijkstra’s algorithm, 4.5
Dijkstra, Edsger, 4.5
data structure, 1.1, 2.2
decay chain, 2.1
decentralized, 1.6
degree, 2.2, 5.5, 5.6
demarcation problem, 6.9
deque, 4.2
design, 1.6
determinism, 1.7, 6.6
deterministic, 1.4, 6, 6.5
dictionary, 2.2, 2.6, 4.2
dictionary methods, 3.2
dimension, 8
directed edge, 2.2
directed graph, 2.1
discrete, 1.4
discrete Fourier transform, 9.2
double-ended queue, 4.2
doubly-linked list, 4.2
Edge, 2.2
Eiffel Tower, 1.6
Eiffel, Gustave, 1.6
EPS, 6.3
Erdős, Paul, 2.5
Erdős-Rényi model, 2.3
earthquake, 8.2, 9.6
economic man, 1.4
economics, 1.4
edge, 2.1, 2.2
edge weight, 2.1
electrical power grid, 5.5
electron, 7.5
emergence, 10.6
emergent property, 10.6
empirical distribution, 5.3
engineering, 1.6
entropy, 6.6
enumeration, 6.1
epistemology, 1.7
equation-based model, 4.6
evolution, 9.5
explanatory model, 1.5, 4.6, 5.7
exponent, 3.1
exponential distribution, 5.3
exponential growth, 3.1
extend, 3.5
Fast Fourier Transform, 9.3
FFT, 9.3
FIFO queue, 4.2
Fourier transform, 9.2
The Fractal Geometry of Nature, 9.5
Freud, Sigmund, 7.5
Fuzzy Thinking, 1.7
falsifiability, 6.9
fireflies, 1.3
flock behavior, 10.4
for loop, 2.6
forest, 2.1
forest fire, 8.2
forest fire model, 8.1, 9.5
four-color theorem, 1.4
fractal, 8.1
fractal cellular automaton, 8.1
fractal dimension, 8, 9.1
fractal geometry, 9.1
fractals, 8
free will, 1.7, 6.6
frequency, 5.1, 9.2
frequentist, 1.7
fringe science, 1.3
Game of Life, 7, 9.4
Game of Life patterns, 7.2
Gardner, Martin, 7
Gaussian distribution, 5.3
Gehry, Frank, 1.6
Gödel’s Incompleteness Theorem, 1.7
Goldstein, Rebecca, 1.7
Gosper, Bill, 7.3
Graph, 2.2
GraphWorld, 2.2
Great Man theory, 9.6
Guggenheim Museum Bilbao, 1.6
game theory, 10.5
gene, 7.4, 9.5
generative model, 4.4, 5.5
generator, 2.7, 3.4
genetics, 9.5
geometric objects, 8
geometric resizing, 3.4
ghost cells, 6.3
glider, 7.2
glider gun, 7.3
graph, 2.1
graph algorithm, 1.1, 2.1, 4.1
graph layout, 2.2
graph methods, 2.2, 3.7
graph theory, 2.1
grassroots, 1.6
gravitation, 1.2
grid, 7, 8.2, 9.1
Hacken, Wolfgang, 1.4
Haldane, J. B. S., 6.9
HashMap, 3.4
Hertz, 9.2
Hist, 5.1
Homo economicus, 1.4
half life, 2.1
harmonics, 9.2
hash function, 3.4
hashtable, 3.4
histogram, 5.2
hoisting, 9.2
holism, 1.5
holist, 9.5
holistic model, 9.5
homogeneous, 1.4
hop, 4.3
hurricane, 7.4, 7.5
Id, 7.5
Incompleteness, 1.7
IPython, 3.5
immutable objects, 2.2
implement, 6.3
implementing cellular automata, 6.2
implementing Game of Life, 7.1
in operator, 3.3
incompleteness, 1.7
indeterminism, 1.7
indexing, 3.2, 9.3
infinite loop, 2.7
infinite sequence, 2.6
inheritance, 2.2, 2.2
__init__, 2.2
instantiate, 6.3
instrumentalism, 1.5, 7.5
interaction, 1.6
interface, 6.3
isolation, 1.6
__iter__, 2.6
iterated Prisoner’s dilemma, 10.5
iterator, 2.6
iteritems, 3.7
itertools, 2.6
join, 3.2
justification, 1.2
Kansas, 4.3
KeyError, 3.4
Kosko, Bart, 1.7
Kuhn, Thomas, 1.3, 1.7, 1.7, 5.7
kernel, 7.1
Langton’s Ant, 7.6
Langton, Chris, 7.6
Laplace’s Demon, 6.6
Laplace, Pierre-Simon, 6.6
Life, 7.1
LifeViewer, 7.1
LinearMap, 3.4
The Little Book of Semaphores, 4.5
label, 2.2
labelling nodes, 4.5
lambda calculus, 6.8

leading coefficient, 3.1
leading term, 3.1
__len__, 3.4
line, 8
linear, 1.4, 3.5
linear congruential generator, 6.5
linear growth, 3.1
linear search, 3.3
list comprehension, 3.7
list methods, 3.2
list of tuples, 3.7
local connection, 4.3
local information, 10.4
log-log plot, 5.1, 5.4, 5.6, 8, 9.4
log-log scale, 3.5
logarithm, 5.1
logarithmic growth, 3.1
logic, 1.7
long tail, 5.4, 9.1
long-tailed distribution, 9.5
long-tailed distributions, 9.6
Mandelbrot, Benoit, 9.5
Massachusetts, 4.3
McGrayne, Sharon Bertsch, 1.7
Methuselah, 7.2
Micromotives and Macrobehavior, 10.2
Milgram, Stanley, 4.3
Monte Carlo simulation, 8.2
Moore neighborhood, 7
machine model, 3
many-valued logic, 1.7
marking a node, 2.4
mathematical proof, 4.6, 5.7
mathematics, 6.10
matplotlib, 3.6
meme, 9.5
microcanonical ensemble, 8.2
model, 1.7, 5.7
modeling, 1.1, 1.2
module
- bisect, 3.3
movie actor, 5.5
mushroom, 7.5
mutable objects, 2.2
A New Kind of Science, 1.2, 6.5, 6.8, 10.6
Newtonian mechanics, 6.6
NumPy, 6.2, 8.1
natural law, 1.2, 10.6
neighbor, 6.1
neighborhood, 7
neighborhoos, 6.1
nested dictionary, 2.2
nested list, 6.2
__new__, 2.2
node, 2.1
noise, 5.6, 9.2
non-linear, 1.4
normal accident theory, 9.6
normal distribution, 5.3
Obama, Barack, 3
object-oriented design, 3.4
objective, 1.7
objectivity, 5.7
observable, 5.7
one, two, many, 1.4
optional parameter, 2.2
order of growth, 3.1, 4.2, 5.2, 6.2, 9.2
os module, 3.5
override, 2.2
Pareto distribution, 5.4
Pareto World, 5.4
Pareto, Vilfredo, 5.4
Perrow, Charles, 9.6
PIL, 6.3
Popper, Karl, 6.9
Postscript, 6.3
PRNG, 6.5
Prisoner’s Dilemma, 10.5
Python Imaging Library, 6.3
paradigm shift, 1.3
parameter, 4.4, 5.1, 5.3, 5.4, 10.1, 10.3, 10.4
path, 2.1, 2.1, 2.4
path length, 4.4
peer-to-peer architecture, 1.6
perception, 7.4
percolation, 8.2
performance error, 4.2
period, 6.5, 7.6
phase chance, 2.5
philosophical realism, 7.4
philosophy, 1.1
physical law, 1.7
physical model, 6.10, 8.2
pink noise, 9.1, 9.4
pitch, 9.2
planetary motion, 1.2, 4.6
plotting CDFs, 5.2
population, 5.4
porosity, 8.2
postulated entity, 7.4
power, 9.2
power law, 5.5, 5.6, 9.1
power spectral density, 9.2
practical analysis of algorithms, 3.1
prediction, 6.9, 9.6
predictive model, 1.5
preferential attachment, 5.5, 5.7
prevalence, 9.5
principle of computational equivalence, 6.8
problem formulation, 2.1
proof, 1.2, 1.3, 4.6, 5.7
proximate cause, 9.6
pseudo-random number generator, 6.5
pseudocolor plot, 7.1
pseudoscience, 1.3
puffer train, 7.3
pyplot, 3.6, 6.3, 7.1
pyplot, 3.6, 5.2
quadratic, 3.5, 3.5, 4.1
quadratic growth, 3.1
quantum mechanics, 6.6
queue, 2.4, 4.1, 4.5
RandomGraph, 2.3
Rényi, Afréd, 2.5
Resnick, Mitchell, 10.3
Reynolds, Craig, 10.4
Rule 110, 6.7
Rule 18, 6.4, 8.1
Rule 254, 8.1
Rule 30, 6.5, 6.5
r-pentomino, 7.2
racism, 1.2, 10.1
radioactive decay, 2.1, 6.6
radix sort, 3
random graph, 2.3, 4.4
random module, 5.3, 5.4, 6.5
random process, 2.1
randomness, 6.5
rank, 5.1, 5.6
read-write head, 7.6
read/write head, 6.8
realism, 1.5, 7.4
realistic model, 6.10
recursive algorithm, 9.3
red-black tree, 3.4, 3.4
reductionism, 1.5
reductionist, 9.5
reference, 6.2
register, 6.8
regular graph, 2.1, 2.2, 4.4
rehashing, 3.4
replicator, 9.5
__repr__, 2.2
repr, 2.2
representing graphs, 2.2
rewire, 4.4
rice pile model, 9.5
rich get richer, 5.5
road network, 2.1
robust, 4.5, 5.6
rule, 6
rule table, 6.1
Schelling, 1.2
Schelling, Thomas, 1.2, 10.1
Schmidt, Eric, 3
SciPy, 7.1
The Selfish Gene, 9.5
Sharon, Massachusetts, 4.3
Sierpiński triangle, 6.4
Sierpiński’s triangle, 8.1
SOC, 9.1
Stanford Large Network Dataset Collection, 5.6
StopIteration, 2.6
Strogatz, Steven, 1.3, 4.4
The Structure of Scientific Revolutions, 1.3, 1.7, 5.7
Superego, 7.5
Swampy, 2.2, 7.6, 10.3
Sync, 1.3
sand pile model, 9.1, 9.5
scale, 5.4
scale-free, 5.4
scale-free network, 5.5
scaling distribution, 5.5
search, 1.6, 3.3
segregation, 1.2, 1.2, 10.1
self-organized criticality, 9.1, 9.4
self-similarity, 9.1
shortcut, 10.6
shortest distance, 2.1
shortest path, 4.5, 4.5
simple graph, 2.1
simple rules, 6.6, 7.6
simplification, 1.2
simulation-based model, 4.6
single source shortest path, 4.5
site percolation, 8.2
six degrees, 4.3, 5.7
small world network, 4.4
small world experiment, 4.3
small world phenomenon, 4.5
social network, 2.1, 4.3
sorting, 3.2, 3.2
source node, 4.5
spaceship, 7.2
spaceships, 6.7
spanning cluster, 8.2
special creation, 6.9
spectral density, 9.2
spherical cow, 1.4
square, 8
stable sort, 3.2
state, 6, 6.1, 9.1
stochastic, 1.4
stock market, 9.6
__str__, 2.2
str, 2.2
strategy, 10.5
string concatenation, 3.2
string methods, 3.2
subjective, 1.7
sum, 3.5
summary statistic, 5.2
summing lists, 3.5
synchronization, 1.3
system, 5.7
system time, 3.5
The Theory That Would Not Die, 1.7
Think Python, 1.1, 7.1
TreeMap, 3.4
Turing complete, 6.7, 7, 7.3
Turing machine, 6.8
Turing, Alan, 6.8, 7.6
Turtles, Termites and Traffic Jams, 10.3
tape, 6.8
tautology, 6.8
theory, 1.7
theory choice, 5.7
threshold value, 2.5
time step, 6
timeit, 3.5
tipping point, 8.2
top-down, 1.6
topology, 5.5
torus, 7
totalistic, 7
traffic jam, 10.3
traverse list, 3.7
triangle of influence, 6.1
tuple, 2.2
tuple methods, 3.2
turmite, 7.6
U.S. Census Bureau, 5.4
UnimplementedMethodException, 6.3
ultimate cause, 9.6
unbounded, 3.1, 7
uncertainty, 1.7
undirected edge, 2.2
undirected graph, 2.1
universal, 7
universal common descent, 6.9
universal gravitation, 4.6
universality, 6.7, 6.8, 7.3
unstable, 9.1
user time, 3.5
Vertex, 2.2
Visual package, 10.4
VPython, 10.4
vertex, 2.1, 2.2
visting a node, 2.4
Watts, Duncan, 4.4
Watts-Strogatz model, 5.5
Wichita, Kansas, 4.3
Wolfram, Stephen, 1.2, 6.1, 10.6
weak ties, 5.7
weight, 2.1, 7.1
weighted sum, 10.4
worklist, 2.4
world-wide web, 5.5
worst case, 3
xenophobia, 1.2, 10.1
yield, 2.7
Zipf plot, 5.6
Zipf’s law, 5.1
zeros, 6.2

Like this book?

Are you using one of our books in a class?

We'd like to know about it. Please consider filling out this short survey.