𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computable explanations

✍ Scribed by J. V. Howard


Publisher
John Wiley and Sons
Year
1975
Tongue
English
Weight
697 KB
Volume
21
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis


und Cjrundhgen d. M d h . lid. 21. SK. 215-224 (1975) COMPUTABLE EXPLANATIONS by J. .. HOWARD in Harrow, Middlesex (Great Brit,ain) I . Introduction 'l'liis paper is concerned with the problem of finding explanations for sequences of O ' S atid 1 's. ('lassification of deterministic explanations for such sequences is achieved in l(t*c*ursive Function Theory, and in the notion of definable sets of natural numbers.

H( ever, we are interested in the more general problem, where statistical explanations of t t i v nryuencc are to be permitted. VON MISES [ l ] defined the idea of a random ~~~~i i ~~t i c e of 0's and 1's as one in which the limiting frequency, p, of 0's in the sequence exists, and for which no rule can be given for choosing an infinite subsequence in wlric.11 this limiting frequency is not p. CHURCH [2] made this definition precise by taking * * I i i k " to mean "algorithm" (i.e. computable procedure). It is, however, easy to think of stat istical explanations which are far more complicated than " 0's occur independently wit ti constant probability p".

1 1 1 Section 2 we define what we mean by an "explanation", and what we mean by saving that a n explanation "explains" a particular infinite sequence of 0's and 1's.

one would hope, if a sequence is produced in accordance with a particular explanation, t l i c b i i that explanation will almost certainly explain it. We show that there are int.splic*able sequences. It is shown that sequences explained by "0's occur independently with probability 3" (for example) form a proper subset of the VON MISES-CHURCH

S ~~I I C I I C C S

with limiting frequency 4. This is because some of these sequences can be bettw explained by saying t h a t 0's occur independently with probability p(n) in the n'th place, where p ( n ) tends to 4 as n tends t o infinity.


📜 SIMILAR VOLUMES


Computable choice functions for computab
✍ Manuel Lerman; Richard Watnick 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 351 KB

## Abstract A choice set for a computable linear ordering is a set which contains one element from each maximal block of the ordering. We obtain a partial characterization of the computable linear order‐types for which each computable model has a computable choice set, and a full characterization i

Explanations
✍ A.A. Merrill 📂 Article 📅 1937 🏛 Elsevier Science 🌐 English ⚖ 69 KB
Computable metrization
✍ Tanja Grubba; Matthias Schröder; Klaus Weihrauch 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB

## Abstract Every second‐countable regular topological space __X__ is metrizable. For a given “computable” topological space satisfying an axiom of computable regularity M. Schröder [10] has constructed a computable metric. In this article we study whether this metric space (__X, d__) can be consid

Complimentary explanations
✍ Jan Javornický 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 164 KB
Average explanations
✍ Alan Nelson 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 1024 KB

Good scientific explanations sometimes appear to make use of averages. Using concrete examples from current economic theory, I argue that some confusions about how averages might work in explanations lead to both philosophical and economic problems about the interpretation of the theory. I formulat