Abstract Views :263 |
PDF Views:79
Authors
Affiliations
1 The Institute of Mathematical Sciences, C.I.T. Campus, Chennai 600 113, IN
Source
Current Science, Vol 106, No 12 (2014), Pagination: 1687-1692
Abstract
What does it mean to say that a fixed infinite string is random? In this article we will attempt to trace the history of this question and the fundamental role of computability theory in our understanding of randomness. In particular, we will describe Turing's observations on the notion of normal numbers and their construction and how that connects up with algorithmic randomness.
Keywords
Algorithmic Randomness, Computability Theory, Infinite String, Normal Numbers.
Full Text