Alternative models of idealized scientific inquiry are investigated and compared. Particular attention is devoted to paradigms in which a scientist is required to determine the truth of a given sentence in the structure giving rise to his data.

This paper tries to express a critical point of view on the computational turn in philosophy by looking at a specific field of study: philosophy of science. The paper starts by briefly discussing the main contributions that information and communication technologies have given to the rising of computational philosophy of science, and in particular to the cognitive modelling approach. The main question then arises, concerning how computational models can cope with the presence of tacit knowledge in science. Would it be (...) possible to develop new ways of handling this specific type of knowledge, in order to incorporate it in computational models of scientific thinking? Or should tacit knowledge lead us to other approaches in using computer sciences to model scientific cognition? These questions are addressed by making reference to a detailed case study of a recent innovation development in the field of biotechnology. (shrink)

One construal of convergent realism is that for each clear question, scientific inquiry eventually answers it. In this paper we adapt the techniques of formal learning theory to determine in a precise manner the circumstances under which this ideal is achievable. In particular, we define two criteria of convergence to the truth on the basis of evidence. The first, which we call EA convergence, demands that the theorist converge to the complete truth "all at once". The second, which we call (...) AE convergence, demands only that for every sentence in the theorist's language, there is a time at which the theorist settles the status of the sentence. The relative difficulties of these criteria are compared for effective and ineffective agents. We then examine in detail how the enrichment of an agent's hypothesis language makes the task of converging to the truth more difficult. In particular, we parametrize first-order languages by predicate and function symbol arity, presence or absence of identity, and quantifier prefix complexity. For nearly each choice of values of these parameters, we determine the senses in which effective and ineffective agents can converge to the complete truth on an arbitrary structure for the language. Finally, we sketch directions in which our learning theoretic setting can be generalized or made more realistic. (shrink)