home.social

#undecidability — Public Fediverse posts

Live and recent posts from across the Fediverse tagged #undecidability, aggregated by home.social.

  1. A great little article. Why pay attention to this? Well…some of the relationships between #Computability, #Undecidability, #Church-#Turing , #SuperDeterminism, #Nonfalsifiability and bits like the #SimulationHypothesis indicate deeper complexities and connections. Is there some underlying dimensionality or topology yet to emerge ? It seems likely, but vexatious

    Via @QuantaMagazine
    ‘Next-Level’ Chaos Traces the True Limit of Predictability
    quantamagazine.org/next-level-

  2. A great little article. Why pay attention to this? Well…some of the relationships between #Computability, #Undecidability, #Church-#Turing , #SuperDeterminism, #Nonfalsifiability and bits like the #SimulationHypothesis indicate deeper complexities and connections. Is there some underlying dimensionality or topology yet to emerge ? It seems likely, but vexatious

    Via @QuantaMagazine
    ‘Next-Level’ Chaos Traces the True Limit of Predictability
    quantamagazine.org/next-level-

  3. A great little article. Why pay attention to this? Well…some of the relationships between #Computability, #Undecidability, #Church-#Turing , #SuperDeterminism, #Nonfalsifiability and bits like the #SimulationHypothesis indicate deeper complexities and connections. Is there some underlying dimensionality or topology yet to emerge ? It seems likely, but vexatious

    Via @QuantaMagazine
    ‘Next-Level’ Chaos Traces the True Limit of Predictability
    quantamagazine.org/next-level-

  4. Fernando Rosas (unfortunately not on Mastodon) asked on bsky:

    "Has anyone figured out what exactly is the relation between the ideas of feedback, recurrence, and self-reference?"

    A really interesting question.

    He pointed to this paper for ideas: arxiv.org/abs/1711.02456
    "Self-referential basis of undecidable dynamics: from The Liar Paradox and The Halting Problem to The Edge of Chaos"

    I did some desk research and found this cool paper:
    arxiv.org/abs/1112.2141
    "Resolving Gödel's Incompleteness Myth: Polynomial Equations and Dynamical Systems for Algebraic Logic"
    that argues there is no essential incompleteness in formal reasoning systems if you look closely enough (using a more elaborate formalism based on polynomial equations to represent and evaluate logical proposition).

    I wonder if analogous construction could be created for related theorems like the halting problem in computability theory.

    #DynamicalSystems #IncompletenessTheorem #PolynomialEquations #HaltingProblem #Undecidability #SelfReference #Recurrence