On randomness, determinism and computability
The question of what constitutes randomness (for nature? for us?) is a deep one. The author considers four approaches: non-repeatability (if you run the experiment again, you may get a different result), unpredictability, patternlessness, and difficult-to-compute. This essay primarily concerns the relation of randomness of the mathematics of chaos. The theorems are taken from \textit{R. L. Devaney}, An introduction to chaotic dynamical systems (1986; Zbl 0632.58005), but the connection to computability and the ``usual intuitive understanding of randomness'' is spelled out.
scientific article; zbMATH DE number 4100363
scientific article