Skip to main content
archive
Search Submit Donate Log in
Press Enter to search · Advanced search

Computer Science > Computational Complexity

arXiv:1111.4121 (cs)
[Submitted on 17 Nov 2011 (v1), last revised 2 Feb 2012 (this version, v2)]

Title:Unpredictability and Computational Irreducibility

Authors:Herve Zwirn, Jean-Paul Delahaye
View a PDF of the paper titled Unpredictability and Computational Irreducibility, by Herve Zwirn and Jean-Paul Delahaye
View PDF
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.
Comments: 20 pages, 5 figures
Subjects: Computational Complexity (cs.CC)
Cite as: arXiv:1111.4121 [cs.CC]
  (or arXiv:1111.4121v2 [cs.CC] for this version)
  https://doi.org/10.48550/arXiv.1111.4121
arXiv-issued DOI via DataCite

Submission history

From: Hervé Zwirn [view email]
[v1] Thu, 17 Nov 2011 15:01:44 UTC (362 KB)
[v2] Thu, 2 Feb 2012 21:14:06 UTC (459 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Unpredictability and Computational Irreducibility, by Herve Zwirn and Jean-Paul Delahaye
  • View PDF
view license

Current browse context:

cs.CC
< prev   |   next >
new | recent | 2011-11
Change to browse by:
cs

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar

DBLP - CS Bibliography

listing | bibtex
Hervé Zwirn
Jean-Paul Delahaye
Loading...

BibTeX formatted citation

Data provided by:

Bookmark

BibSonomy Reddit

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
We gratefully acknowledge support from our major funders, member institutions, , and all contributors.
About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)
Major funding support from
Simons Foundation Simons Foundation International Schmidt Sciences