Unpredictability and computational irreducibility - HAL Access content directly
Other publications Year : 2011

Unpredictability and computational irreducibility

Abstract

We explore several concepts for analyzing the intuitive notion of computational irreducibility and we propose a robust formal definition, first in the field of cellular automata and then in the general field of any computable function f from N to N. We prove that, through a robust definition of what means "to be unable to compute the nth step without having to follow the same path than simulating the automaton or the function", this implies genuinely, as intuitively expected, that if the behavior of an object is computationally irreducible, no computation of its nth state can be faster than the simulation itself.
Loading...
No file

Dates and versions

halshs-00792319, version 1 (21-02-2013)

Identifiers

  • HAL Id : halshs-00792319 , version 1

Cite

Hervé Zwirn, Jean-Paul Delahaye. Unpredictability and computational irreducibility. 2011. ⟨halshs-00792319⟩
72 View
0 Download
Last update date on 5/18/24
How are these indicators produced

Share

Gmail Facebook Twitter LinkedIn More