Professional Documents
Culture Documents
"The strategies for making mathematical models for observed phenomena have been
evolving since ancient times. An organism– physical, biological, or social– is observed
in different states. This observed system is the target of the modelling activity. Its states
cannot really be described by only a few observable parameters, but we pretend that
they can."
–Ralph Abraham and Christopher Shaw, Dynamics: The Geometry of Behavior1
A picture is worth a thousand words, and what computer modelling might mean in
philosophical research is best illustrated by example. We begin with an intuitive
introduction to three very simple models. More sophisticated versions and richer
variations are presented with greater philosophical care in the chapters that follow.
1
Redwood City, California: Addison-Wesley, 1992; p. 15.
2
Quoted in Clifford A. Pickover, Computers, Pattern, Chaos and Beauty, New York: St. Martin's Press,
1990, p. 10.
3
Autobiography, vol. 1, New York: Bantam Books, 1951, pp. 200-201.
Let’s start by supposing it is true. What it says is that it is false. So if we start by
assuming it true it appears we’re forced to change our verdict: it must be false.
Our verdict now, then, is that the boxed sentence is false. But here again we run into the
fact that what the sentence says is that it is false. If what it says is that it is false and
it is false, it appears it must be true.
This kind of informal thinking about the Liar exhibits a clear and simple dynamics: a
supposition of ‘true’ forces us to ‘false’, the supposition of ‘false’ forces us back to
‘true’, the supposition of ‘true’ forces us back to ‘false’, and so forth. We can get a very
simple model for that intuitive dynamics in terms of a graph.
As in figure 1, we will let 1 represent ‘true’ at the top of our graph, and let 0 represent
‘false’ at the bottom. The stages of our intuitive deliberation – ‘now it looks like it’s
true...but now it looks like it’s false...’– will be marked as if in moments of time
proceeding from left to right.
This kind of graph is known as a time-series graph. In this first simple philosophical
application, a time-series graph allows us to map the dynamic behaviour of our intuitive
reasoning for the Liar as in figure 2.4
4
Here it is of course only the alternation between True and False at discrete points of deliberation that is
graphed. ‘Bounce’ lines between points of deliberation are not meant to indicate that deliberation passes
through intermediate truth values.
Figure 2. Time series graph for intuitive reasoning of the Liar
This simple model is the basic foundation of some of the work of chapter 1, though of
course only the foundation. There such a model is both carried into infinite-valued or
fuzzy logics and applied to wide range of self-referential sentences. One of these –the
Chaotic Liar– has the dynamics portrayed in figure 3.
The model itself suggests richer elaborations, offering images for mutually referential
sentences such as that shown in figure 4. Similar modelling is extended to some
intriguing kinds of epistemic instability in chapter 2.
Figure 4. Escape-time diagram for a Dualist form of the Liar
"...I should like to sketch a picture connected with the deepest intuitive feelings I always
get about logistic. This picture perhaps throws more light than any discursive exposition
would on the real foundations from which this science grows (at least so far as I am
concerned). Whenever I am occupied even with the tiniest logistical problem, e.g. trying
to find the shortest axiom of the implicational calculus, I have the impression that I am
confronted with a mighty construction, of indescribable complexity and immeasurable
rigidity. This construction has the effect upon me of a concrete tangible object,
fashioned from the hardest of materials, a hundred times stronger than concrete and
steel. I cannot change anything in it; by intense labour I merely find in it ever new
details, and attain unshakeable and eternal truths."
–Jan Lukasiewicz, W obronie Logistyki5
Here we offer another simple model, one we develop further in chapter 3 in the attempt
to capture something like a Lukasiewiczian picture of formal systems as a whole.
p
T
F
5
In Z zaganien logiki i filozofii, Warsaw: Paustwowe Wydawnictwo Naukowe, 1961, tr. by Peter Geach
in A Wittgenstein Workbook, Berkeley: University of California Press, 1970, p. 22.
It is in terms of these that we draw a simple truth-table showing corresponding values
for ‘not p’: if p happens to be true, ‘not p’ must be false; if p happens to be false,
‘not p’ must be true:
p ~p
TF
FT
What we’ve drawn for p and ~p are two two-line truth tables. But these are of course
not the only two-line combinations possible. We get all four possibilities if we add
combinations for tautologies, thought of as always true, and contradictions, thought of
as always false:
p ~p
F TF T
F FT T
Now consider the possibility of assigning each of these combinations of truth and falsity
a different colour:
p ~p
F T F T
F F T T
With these colours for basic value combinations we can paint simple portraits of
classical connectives such as conjunction (‘and’) and disjunction (‘or’). Figure 5 is a
portrait of conjunction: the value colours on its axes combine in conjunction to give the
values at points of intersection. The conjunction of black with black in the upper left
corner, for example, gives us black, indicating that the conjunction of two
contradictions is a contradiction as well.
What this offers is a very simple matrix model for logical operators. In chapter 3 we
attempt to extend the model so as to depict formal systems as a whole, allowing us also
to highlight some surprising formal relationships between quite different formal
systems. One result is the appearance of classical fractal patterns within value portraits
much like that outlined above. Figure 7 shows the pattern of tautologies in a more
complicated value space, here for the operator NAND (or the Sheffer stroke) and for a
system with 3 sentence letters and thus 256 possible truth-table columns. The image that
appears is familiar within fractal geometry as the Sierpinski gasket.7
6
See for example W. V. Quine, Methods of Logic, New York: Holt, Rinehart, and Winston, 1959.
7
See for example Manfred Schroeder, Fractals, Chaos, Power Laws, New York: W. H. Freeman and
company, 1991.
imagines as a state of war, "where every man is Enemy to every man," and in which the
life of man, as a result, is "solitary, poor, nasty, brutish, and short".8
How might social cooperation emerge in a society of egoists? This is Hobbes’s central
question, and one he answers in terms of two ‘general rules of Reason’. Since there can
be no security in a state of war, it will be clear to all rational agents "that every man,
ought to endeavour peace, as farre as he has hope of obtaining it; and when he cannot
obtain it, that he may seek, and use, all helps and advantages of Warre". From this
Hobbes claims to derive a second rational principle: "That a man be willing, when
others are so too...to lay down this right to all things; and be contented with so much
liberty against other men, as he would allow other men against himself."9
In later chapters we develop some very Hobbesian models of social interaction using
game theory within cellular automata (akin to the ‘game of Life’).10 The basic question
is the same: How might social cooperation emerge within a society of self-serving
egoists? Interestingly, the model-theoretic answers that seem to emerge often echo
Hobbes’s second principle.
The most studied model of social interaction in game theory is undoubtedly the
Prisoner’s Dilemma. Here we envisage two players who must simultaneously make a
‘move’, choosing either to ‘cooperate’ with the other player or to ‘defect’ against the
other player. What the standard Prisoner’s Dilemma matrix dictates is how much each
player will gain or lose on a given move, depending on the mutual pattern of
cooperation and defection:
Player A
C D
C (3,3) (0,5)
Player B
D (5,0) (1,1)
If both players cooperate on a single move, both get 3 points. If both defect, each gets
only 1 point. But if one player defects and the other cooperates, the defector gets a full 5
points and the cooperator walks away with nothing. Because it favours both mutual
cooperation and individual defection, the Prisoner’s Dilemma has been widely used to
study options for cooperation in an egoistic society. In a model that we use extensively
in later chapters, members of a society are envisaged in a spatial array, following
particular strategies in repeated Prisoner’s Dilemma exchanges with their neighbours.
Figure 8, for example, shows a randomized array in which each cell represents a single
individual and each colour represents one of eight simple strategies for repeated play.
8
Hobbes, Leviathan, Part I, Ch. 13.
9
Hobbes, Leviathan, Part I, Ch. 14.
10
John Horton Conway’s ‘Game of Life’ itself plays an important role in a later chapter on ‘real Life’ and
in the background motivation for the undecidability result of chapter seven. Hobbes himself, interestingly
enough, begins the Leviathan by asking "may not we say that all Automata have...an artificial life?"
Figure 8. Randomized spatial array of eight prisoner's dilemma strategies
Some of these are vicious strategies, in the sense of always defecting against their
neighbours. Some are extremely generous, in the sense of cooperating no matter how
often they are burned. A strategy of particular interest, called ‘Tit for Tat’, returns like
for like, cooperating with a cooperative partner but defecting against a defector. ‘Tit for
Tat’ carries a clear echo of Hobbes’ second ‘Rule of Reason’: "Whatsoever you require
that others should do to you, that do you to them".11
Figure 9 shows a typical evolution in a very simple case, in which Tit for Tat evolves as
the standard strategy.
11
Hobbes, Leviathan, Part I, Ch. 14.
Figure 9. Evolution of randomized arrays towards dominance by Tit for Tat
In later chapters we explore more complicated variations on such a model, using ranges
of more complicated meta-strategies and introducing forms of cooperation and defection
‘imperfect’ both probabilistically and in terms of degrees. An undecidability result for
even a very simple spatialized Prisoner’s Dilemma appears in chapter 6.
In each of the following chapters the computer allows us to literally see things the
complexity of which would otherwise be beyond our computational reach: fractal
images showing the semantic behaviour of a wide range of pairs of mutually referential
sentences, vivid images of patterns of contradiction and tautology in formal systems,
and evolving visual arrays demonstrating a wide social effect of local game-theoretic
interactions. Whether these answer questions which we might not have been able to
answer without them is another matter. Often our logical results, such as the formal
indefinability of chaos in chapter 1 or the undecidability of the Spatialized Prisoner’s
Dilemma in chapter 6, were suggested by our computer work but might also
conceivably have been proven without it. We don’t want to claim, then –at least not
yet– that the computer is answering philosophical questions that would be in principle
unanswerable without it. In no way do the astounding computational abilities of
contemporary machines offer a substitute for philosophical research. But we do think
that they offer an important new environment for philosophical research.
Our experience is that the environment of computer modelling often leads one to ask
new questions, or to ask old questions in new ways –questions about chaos within
patterns of paradoxical reasoning or epistemic crises, for example, or Hobbesian
questions asked within a spatialization of game-theoretic strategies. Such an
environment also enforces, unflinchingly and without compromise, the central
philosophical desideratum of clarity: one is forced to construct theory in the form of
fully explicit models, so detailed and complete that they can be programmed. With the
astounding computational resources of contemporary machines, moreover, hidden and
unexpected consequences of simple theories can become glaringly obvious: "A
computer will do what you tell it to do, but that may be much different from what you
had in mind."12
12
Joseph Weizenbaum quoted in Time, The Merriam-Webster Dictionary of Quotations, 1996.
Although difficult to characterize, it is also clear from experience that computer
modelling offers a possibility for thoroughly conceptual work that is nonetheless
undeniably experimental in character. Simple theories can be tested in a range of
modelled counterfactual ‘possible worlds’– Hobbesian models can be tested in worlds
with and without perfect information or communication, for example, or with a greater
or lesser Rawlsian ‘veil of ignorance’. One can also, however, test theoretical variations
essentially at will, feeling one’s way through experimental manipulation toward a
conceptual core: an hypothesis of precisely what it is about a theory that accounts for
the appearance of certain results in certain possible worlds.
It must also be admitted with regard to computer modelling –as with regard to
philosophical or intellectual modelling in general– that models can fail. All models are
built with major limitations –indeed that is the very purpose of models. Models prove
useful both in exposition and exploration precisely because they’re simpler, and
therefore easier to handle and easier to track, than the bewildering richness of the full
phenomena under study. But the possibility always remains that one’s model captures
too few aspects of the full phenomenon, or that it captures accidental rather than
essential features. One purpose of labelling ours as explorations in computer modelling
is to emphasize that they may fail in this way. When and where they fall short, however,
it will be better models that we will have to strive for.
Our ultimate hope is that others will find an environment of computer modelling as
philosophically promising as we have. We offer a handful of sample explorations with
operating software and accessible source code in the hope that some of our readers will
not only enjoy some of these initial explorations but will find tools useful in carrying
the exploration further.