Beavers at the limits of computation

MaRDI QIDQ7313200zbMATH OpenFDO

Authors Sergio Miguéns Iglesias

Publication date 12 August 2026

Published in La Gaceta de la Real Sociedad Matemática Española (Search for Journal in Brave)

Full work available at URL https://gaceta.rsme.es/abrir.php?id=1952

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Classical models of computation (Turing machines, etc.) (68Q04)

Cites work

• A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory
• Computer Studies of Turing Machine Problems
• scientific article; zbMATH DE number 8896 (Why is no real title available?)
• On computable numbers, with an application to the Entscheidungsproblem.
• On non-computable functions
• Some Unconventional Problems in Number Theory
• The Determination of the Value of Rado's Noncomputable Function | sum(k) for Four-State Turing Machines
• Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme. I.

This page was built for publication: Beavers at the limits of computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7313200)