Recently several philosophers of science have proposed what has come to be known as the semantic account of scientific theories. It is presented as an improvement on the positivist account, which is now called the syntactic account of scientific theories. Bas van Fraassen claims that the syntactic account does not give a satisfactory definition of "empirical adequacy" and "empirical equivalence". He contends that his own semantic account does define these notations acceptably, through the concept of "embeddability", a concept which he (...) claims cannot be defined syntactically. Here, I define a syntactic relation which corresponds to the semantic relation of "embeddability". I suggest that the critical differences between the positivist account and van Fraassen's account have nothing to do with the distinction between semantics and syntax. (shrink)

Much of scientific inference involves fitting numerical data with a curve, or functional relation. The received view is that the fittest curve is the curve which best balances the conflicting demands of simplicity and accuracy, where simplicity is measured by the number ofparameters in the curve. The problem with this view is that there is no commonly accepted justification for desiring simplicity. This paper presents a measure of the stability of equations. It is argued that the fittest curve is the (...) curve which best balances stability and accuracy. The received view is defended with a proof that simplicity corresponds to stability, for linear regression equations. 1This paper is based on part of my doctoral dissertation. My thanks go to my thesis supervisor Professor Alasdair Urquhart for his encouragement, constructive criticism, and for directing me to several relevant articles: to my advisor Professor Ian Hacking for reminding me to concentrate on results that might have some application in the real world; and to my friend Wendy Brandts for sharing her ideas on a closely related problem. My thanks also to an anonymous referee of The British Journal of the Philosophy of Science for several helpful comments, to my friends and family for unfailing support, and to the Social Sciences and Humanities Research Council (awards 452-86-5885 and 453-87-0513) and the University of Toronto for financial assistance. (shrink)

Karl Popper equates simplicity with falsifiability. He develops his argument for this equation through a geometrical example. There is a flaw in his example, which undermines his claim that simplicity is falsifiability. I point out the flaw here.

Much of scientific inference involves fitting numerical data with a curve, or functional relation. The received view is that the fittest curve is the curve which best balances the conflicting demands of simplicity and accuracy, where simplicity is measured by the number ofparameters in the curve. The problem with this view is that there is no commonly accepted justification for desiring simplicity.This paper presents a measure of the stability of equations. It is argued that the fittest curve is the curve (...) which best balances stability and accuracy. The received view is defended with a proof that simplicity corresponds to stability, for linear regression equations. (shrink)

Robert French has argued that a disembodied computer is incapable of passing a Turing Test that includes subcognitive questions. Subcognitive questions are designed to probe the network of cultural and perceptual associations that humans naturally develop as we live, embodied and embedded in the world. In this paper, I show how it is possible for a disembodied computer to answer subcognitive questions appropriately, contrary to French’s claim. My approach to answering subcognitive questions is to use statistical information extracted from a (...) very large collection of text. In particular, I show how it is possible to answer a sample of subcognitive questions taken from French, by issuing queries to a search engine that indexes about 350 million Web pages. This simple algorithm may shed light on the nature of human cognition, but the scope of this paper is limited to demonstrating that French is mistaken: a disembodied computer can answer subcognitive questions. (shrink)

The logic of scientific discovery is now a concern of computer scientists, as well as philosophers. In the computational approach to inductive inference, theories are treated as algorithms (computer programs), and the goal is to find the simplest algorithm that can generate the given data. Both computer scientists and philosophers want a measure of simplicity, such that simple theories are more likely to be true than complex theories. I attempt to provide such a measure here. I define a measure of (...) simplicity for directed graphs, inspired by Herbert Simon''s work. Many structures, including algorithms, can be naturally modelled by directed graphs. Furthermore, I adapt an argument of Simon''s to show that simple directed graphs are more stable and more resistant to damage than complex directed graphs. Thus we have a reason for pursuing simplicity, other than purely economical reasons. (shrink)