On randomness, determinism and computability (Q1120202)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On randomness, determinism and computability |
scientific article; zbMATH DE number 4100363
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On randomness, determinism and computability |
scientific article; zbMATH DE number 4100363 |
Statements
On randomness, determinism and computability (English)
0 references
1988
0 references
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.
0 references
chaotic dynamics
0 references
recursive functions
0 references
unsolvability
0 references
degrees of
0 references
randomness
0 references
random number generators
0 references
subjective probability
0 references
random experiment
0 references
analysis of residuals
0 references
Turing machine
0 references
non- repeatability
0 references
unpredictability
0 references
patternlessness
0 references
chaos
0 references
computability
0 references
0 references
0.9254737
0 references
0.91423833
0 references
0 references
0.9061014
0 references
