Christopher P. Porter

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
A fruitful way of obtaining meaningful, possibly concrete, algorithmically random numbers is to consider a potential behaviour of a Turing machine and its probability with respect to a measure (or semi-measure) on the input space of binary codes. For example, Chaitin's Ω is a well known Martin-Löf random number that is obtained by considering the halting(More)
In this article, I discuss the extent to which Kolmogorov drew upon von Mises' work in addressing the problem as to why probability is applicable to events in the real world, which I refer to as the applicability problem. In particular, I highlight the role of randomness in Kolmogorov's account, and I argue that this role differs significantly from the role(More)
  • 1