On randomness, determinism and computability
type: Item
instance of: scholarly article
title: On randomness, determinism and computability
zbMATH Open document ID: 0672.62001
DOI: 10.1016/0378-3758(88)90093-6
author: Edward J. Wegman
published in: Journal of Statistical Planning and Inference
publication date: 1988-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 62A01
Mathematics Subject Classification ID: 60A99
Mathematics Subject Classification ID: 62M10
zbMATH DE Number: 4100363
zbMATH Keywords: chaotic dynamics
zbMATH Keywords: recursive functions
zbMATH Keywords: unsolvability
zbMATH Keywords: degrees of
zbMATH Keywords: randomness
zbMATH Keywords: random number generators
zbMATH Keywords: subjective probability
zbMATH Keywords: random experiment
zbMATH Keywords: analysis of residuals
zbMATH Keywords: Turing machine
zbMATH Keywords: non- repeatability
zbMATH Keywords: unpredictability
zbMATH Keywords: patternlessness
zbMATH Keywords: chaos
zbMATH Keywords: computability
reviewed by: Henry E. jun. Kyburg
MaRDI profile type: Publication
full work available at URL: 0378-3758(88)90093-6
OpenAlex ID: W2011356995
cites work: Q5448294
cites work: A Theory of Program Size Formally Identical to Information Theory
cites work: Algorithmic Information Theory
cites work: Q5842591
cites work: Q3247126
cites work: Q5606304
cites work: Q3769642
cites work: Q3214803
Recommended article: Q3611832
Recommended article: Computability and Randomness
Recommended article: Q4513960
Recommended article: Randomness and Computability: Open Questions
Recommended article: Q3096589
Recommended article: Q3224093
Recommended article: Randomness, computability, and density
Recommended article: Q2762505
Recommended article: Computability on random variables
Recommended article: Randomness and the linear degrees of computability
description: scientific article; zbMATH DE number 4100363