
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

+= operator, A.5
 1D cellular automaton, 5.2
 1/f noise, 8.1
 2D cellular automaton, 8.2
 Anaconda, 0.3
 Appel, Kenneth, 1.2
 Aristotelian logic, 1.5
 Axelrod, Robert, 12.3
 abstract model, 1, 3.8, 4.8, 5.9, 8.2
 agent, 1
 agentbased model, 1, 9, 9.1
 algorithm, A
 analogy, 4.8, 8.7
 analysis, 1.4
 analysis of algorithms, A
 analysis of graph algorithms, 2.8
 analysis of primitives, A.2
 argument by analogy, 4.8, 5.9
 array, 5.10
 asymptotic analysis, A
 avalanche, 8.2
 average case, A
 average cost, A.4
 Bak, Per, 7.7, 8.7
 Bayesian, 1.5
BetterMap , A.4
 BFS, 2.8
 The Big Sort, 9.9
 Bishop, Bill, 9.9
 badness, A.1
 beetles, 5.8
 behavior, 4.8
 bigoh notation, A.1
bisect module, A.3
 bisect module, A.3
 bisection
search, A.3
 boid, 10.3
 bottomup, 1.4
 bounded, A.4
 breadth first search, 2.8
 brick wall, 9.8
 broadcast service, 1.4
 bubble sort, A
 busy beaver, 5.13
 CDF, 4.7
 ChurchTuring thesis, 5.7
 Class 3 behavior, 5.4
 Class 4 behavior, 5.7, 6.3
 Conway, John H., 6.1
 Cook, Matthew, 5.6
 carrot, 10.3
 causation, 5.5, 8.8, 9.1
 cell, 5.7
 cellular automaton, 5
 centralized, 1.4
 chaos, 5.5
 classifying cellular automatons, 5.3
 clientserver architecture, 1.4
 clique, 3.2
 clone, 0.3
 clustering, 3.2
 comparing algorithms, A
 comparison sort, A.2
 complex behavior, 5.5, 6.1, 6.7
 complex model, 1.3
 complex systems, 0
 complexity science, 0, 1.1
 composite, 1.2
 computable function, 5.7
 computation, 1.4
 computational model, 1.1
 computationally irreducible, 9.8
 conception, 6.4
 cone snail, 5.9
 connected graph, 2.5
 constant time, A.4
 continuous, 1.2
 contributors, 0.3, 0.3
 cow, spherical, 1.2
 criteria for models, 1.2
 critical value, 2.3
 crossover point, A.1
 cumulative distribution function, 4.7
 Dawkins, Richard, 8.7
 Detroit, 1
 DieHarder, 5.13
 Dijkstra’s algorithm, 3.10
 Dijkstra, Edsger, 3.10
 decentralized, 1.4
 demarcation problem, 5.13
 design, 1.4
 determinism, 1.5, 5.5
 deterministic, 1.2, 5.1, 5.4
 dictionary methods, A.2
 directed graph, 2.1
 discrete, 1.2
 Eiffel Tower, 1.4
 Eiffel, Gustave, 1.4
 Erdős, Paul, 2.3
 ErdősRényi model, 2.3
 earthquake, 8.8
 economic man, 1.2
 economics, 1.2
 edge, 2.1
 edge weight, 2.1
 electrical power grid, 4.5
 electron, 6.5
 emergence, 9.8
 emergent property, 9.8
 engineering, 1.4
 entropy, 5.5
 enumeration, 5.2
 epistemology, 1.5
 equationbased model, 3.8
 evolution, 8.7
 explanatory model, 1.3, 3.8, 4.8
 exponent, A.1
 exponential growth, A.1
extend , A.5
 Freud, Sigmund, 6.5
 Fuzzy Thinking, 1.5
 falsifiability, 5.8
 fireflies, 1.1
 flock behavior, 10.3
 forest fire model, 7.7
 fork, 0.3
 fourcolor theorem, 1.2
 fractal dimension, 7.5
 fractal geometry, 8.1
 free will, 1.5, 5.5
 frequentist, 1.5
 fringe science, 1.1
 Game of Life, 6.1, 8.9
 Game of Life patterns, 6.2
 Gardner, Martin, 6.1
 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
 Great Man theory, 8.9
 Guggenheim Museum Bilbao, 1.4
 gene, 6.4, 8.7
 generative model, 3.2, 4.5
 generator, A.4
 genetics, 8.7
 geometric resizing, A.4
 glider, 6.2
 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
 Hacken, Wolfgang, 1.2
 Haldane, J. B. S., 5.8
 HashMap, A.4
 Homo economicus, 1.2
 hash function, A.4
 hashable, 2.2
 hashtable, A.4
 heavytailed distribution, 8.9
 heavytailed distributions, 8.8
 holism, 1.3
 holist, 8.7
 holistic model, 8.7
 homogeneous, 1.2
 hop, 3.1
 hurricane, 6.4, 6.5
 Id, 6.5
 Incompleteness, 1.5
 IPython, A.5
 implementing cellular automatons, 5.10
in operator, A.3
 incompleteness, 1.5
 indeterminism, 1.5
 indexing, A.2
 instrumentalism, 1.3, 6.5
 interaction, 1.4
 isolation, 1.4
 Jupyter, 0.3
join , A.2
 justification, 1
 Kansas, 3.1
KeyError , A.4
 Kosko, Bart, 1.5
 Kuhn, Thomas, 1.5, 1.5, 4.9
 Langton’s Ant, 6.7
 Langton, Chris, 6.7
 Laplace’s Demon, 5.5
 Laplace, PierreSimon, 5.5
LinearMap , A.4
 The Little Book of Semaphores, 3.10
 lambda calculus, 5.7
 leading coefficient, A.1
 leading term, A.1
\_\_len\_\_ , A.4
  linear, 1.2, A.5
 linear congruential generator, 5.4
 linear growth, A.1
 linear search, A.3
 list methods, A.2
 local connection, 3.1
 local information, 10.3
 loglog scale, A.5
 logarithmic growth, A.1
 logic, 1.5
 long tail, 8.1
 Mandelbrot, Benoit, 8.9
 Massachusetts, 3.1
 McGrayne, Sharon Bertsch, 1.5
 Methuselah, 6.3
 Milgram, Stanley, 3.1
 Moore neighborhood, 6.1
 machine model, A
 manyvalued logic, 1.5
 mathematical proof, 3.8, 4.8
 mathematics, 5.9
 matplotlib, A.6
 meme, 8.7
 model, 1.5, 4.8
 modeling, 1
 module
 movie actor, 4.5
 mushroom, 6.5
 A New Kind of Science, 5.4, 5.7, 9.8
 Newtonian mechanics, 5.5
 NumPy, 5.10
 natural law, 1, 9.8
 neighbor, 5.2
 neighborhood, 6.1
 neighborhoos, 5.2
 nested list, 5.10
 node, 2.1
 nonlinear, 1.2
 normal accident theory, 8.8
 np.where, 9.2
 Obama, Barack, A
 objectoriented design, A.4
 objective, 1.5
 objectivity, 4.9
 observable, 4.8
 one, two, many, 1.2
 order of growth, 3.11, A.1
os module, A.5
 oscillator, 6.2
 Perrow, Charles, 8.8
 Popper, Karl, 5.8
 PRNG, 5.4
 Prisoner’s Dilemma, 12.1
 parameter, 3.2, 10.5
 path, 2.1, 2.5
 path length, 3.2
 peertopeer architecture, 1.4
 perception, 6.4
 percolation, 7.3
 performance error, 3.11
 period, 5.4, 6.7
 philosophical realism, 6.4
 physical law, 1.5
 physical model, 5.9
 pink noise, 8.1
 planetary motion, 1, 3.8
 postulated entity, 6.4
 power law, 8.1
 practical analysis of algorithms, A.1
 prediction, 5.8, 8.8
 predictive model, 1.3
 preferential attachment, 4.5, 4.8
 prevalence, 8.7
 principle of computational equivalence, 5.7
 proof, 1, 1.1, 3.8, 4.8
 proximate cause, 8.8
 pseudorandom number generator, 5.4
 pseudoscience, 1.1
 puffer train, 6.3
 pyplot, A.6
pyplot , A.6
 quadratic, 2.8, A.5, A.5
 quadratic growth, A.1
 quantum mechanics, 5.5
 Rényi, Afréd, 2.3
 Resnick, Mitchell, 10.1
 Reynolds, Craig, 10.3
 Rule 110, 5.6
 Rule 18, 5.3
 Rule 30, 5.4, 5.13
 rpentomino, 6.3
 racism, 1, 9.1
 radioactive decay, 5.5
 radix sort, A
 random graph, 2.3, 3.2
random module, 5.13
 randomness, 5.4
 readwrite head, 6.7
 read/write head, 5.7
 realism, 1.3, 6.4
 realistic model, 5.9
 redblack tree, A.4, A.4
 reductionism, 1.3
 reductionist, 8.7
 reference, 5.10
 register, 5.7
 regular graph, 3.2
 rehashing, A.4
 replicator, 8.7
 repository, 0.3
 representing graphs, 2.1
 rewire, 3.2
 rich get richer, 4.5
 road network, 2.1
 robust, 3.11
 rule, 5.1
 rule table, 5.2
 Schelling, 1
 Schelling, Thomas, 1, 9.1
 Schmidt, Eric, A
 The Selfish Gene, 8.7
 Sharon, Massachusetts, 3.1
 Sierpiński triangle, 5.3
 SOC, 8.1
 Strogatz, Steven, 1.1, 3.2
 The Structure of Scientific Revolutions, 1.5
 Superego, 6.5
 Sync, 1.1
 sand pile model, 8.2, 8.7
 scalefree network, 4.5
 search, 1.4, A.3
 segregation, 1, 1, 9.1
 selforganized criticality, 8.9
 selfsimilarity, 8.1
 shortcut, 9.8
 shortest path, 3.10
 simple rules, 5.5, 6.7
 simplification, 1
 simulationbased model, 3.8
 single source shortest path, 3.10
 six degrees, 3.1, 4.8
 small world
network, 3.2
 small world experiment, 3.1
 small world phenomenon, 3.11
 social network, 2.1, 3.1
 sorting, A.2, A.2
 spaceship, 6.2
 spaceships, 5.6
 special creation, 5.8
 spherical cow, 1.2
 stable sort, A.2
 state, 5.1, 5.2, 8.2
 stochastic, 1.2
 stock market, 8.8
 string concatenation, A.2
 string methods, A.2
 subjective, 1.5
sum , A.5
 summing lists, A.5
 synchronization, 1.1
 system, 4.8
 system time, A.5
 The Theory That Would Not Die, 1.5
TreeMap , A.4
 Turing complete, 5.6, 6.1, 6.3
 Turing machine, 5.7
 Turing, Alan, 5.7, 6.7
 Turtles, Termites and Traffic Jams, 10.1
 tape, 5.7
 tautology, 5.7
 theory, 1.5
 theory choice, 4.9
 threshold value, 2.3
 time step, 5.1
timeit , A.5
 topdown, 1.4
 torus, 6.1
 traffic jam, 10.1
 triangle of influence, 5.2
 tuple methods, A.2
 turmite, 6.7
 ultimate cause, 8.8
 unbounded, 6.1, A.1
 uncertainty, 1.5
 undirected graph, 2.1
 universal, 6.1
 universal common descent, 5.8
 universal gravitation, 3.8
 universality, 5.6, 5.7, 6.3
 unstable, 8.1
 user time, A.5
 vertex, 2.1
 Watts, Duncan, 3.2
 Wichita, Kansas, 3.1
 Wolfram, Stephen, 9.8
 weak ties, 4.8
 weight, 2.1
 weighted sum, 10.3
 worldwide web, 4.5
 worst case, A
 xenophobia, 1, 9.1


Are you using one of our books in a class? We'd like to know
about it. Please consider filling out this short survey.
Think DSP
Think Java
Think Bayes
Think Python 2e
Think Stats 2e
Think Complexity
