Philosophy of Science · 2022 · 16 citations · 22 references
ComputingComputer ScienceArtificial IntelligencePhilosophy Of ScienceTheory Of ComputationComputational ModelingComputational ModelsEmergenceIrreducibilityPredictability TheoryReducibility
Abstract A phenomenon resulting from a computationally irreducible (or computationally incompressible) process is supposedly unpredictable except via simulation. This notion of unpredictability has been deployed to formulate recent accounts of computational emergence. Via a technical analysis, I show that computational irreducibility can establish the impossibility of prediction only with respect to maximum standards of precision. By articulating the graded nature of prediction, I show that unpredictability to maximum standards is not equivalent to being unpredictable in general. I conclude that computational irreducibility fails to fulfill its assigned philosophical roles in theories of computational emergence.
22
VERIFICATION OF FORECASTS EXPRESSED IN TERMS OF PROBABILITY
Glenn W. Brier · Monthly Weather Review · 1950 · 5.3K citations
Business, Mathematics, Meteorology +10
The conscious mind: in search of a fundamental theory
Choice Reviews Online · 1996 · 4.2K citations
Humanities, Neuroscience, Psychology +11
Studies in the Logic of Explanation
Carl G. Hempel, Paul Oppenheim · Philosophy of Science · 1948 · 3.1K citations
Cellular automata as models of complexity
Stephen Wolfram · Nature · 1984 · 1.5K citations