Philosophy of Computer Science
Kemeny's Version of
the Scientific Method
Last Update: 21 January 2010
Note:
or
material is highlighted
|
Based on:
Kemeny, John G. (1959),
A Philosopher Looks at Science
(Princeton: D. van Nostrand).
[
Intro & Chs. 5, 10 in PDF]
Algorithm Scientific_Method {an infinite loop ("cycle")}
begin
while there is a new fact to observe, do:
{i.e., repeat until there are no new facts to observe,
which will never happen, so we have
permanent inquiry}
begin
- observe facts;
{express as "particular" statements:
Note: facts may be "theory-laden",
i.e., based on assumptions}
- induce general statements;
- deduce future observations; {prediction}
- verify predictions against observations;
{if Qc then general statment confirmed
or consistent with theory
else revise theory
(or …)}
end
end.
Copyright © 2004–2010 by
William J. Rapaport
(rapaport@buffalo.edu)
http://www.cse.buffalo.edu/~rapaport/584/S10/kemeny-scimeth.html-20100121