Cover Image

On Chaitin's Heuristic Principle and Halting Probability

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Salehi, Saeed
Format:	Preprint
Published:	2023
Subjects:	Logic Information Theory Logic in Computer Science 03F40, 68Q30, 60A10, 28A05, 68Q04, 03D10
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Why the classes P and NP are not well-defined finitarily
by: Anand, Bhupinder Singh
Published: (2024)

Algebra of Self-Replication
by: Moss, Lawrence S.
Published: (2023)

A Logspace Constructive Proof of L=SL
by: Buss, Sam, et al.
Published: (2025)

Choiceless Polynomial Space
by: Ferrarotti, Flavio, et al.
Published: (2024)

Variants of Solovay reducibility
by: Titov, Ivan
Published: (2024)

There is a deep 1-generic set
by: Li, Ang
Published: (2024)

Computability of Initial Value Problems
by: Brattka, Vasco, et al.
Published: (2024)

The equational theory of the Weihrauch lattice with multiplication
by: Neumann, Eike, et al.
Published: (2024)

Executable Boundary Contracts for Sound Event Traces
by: Alpay, Faruk, et al.
Published: (2026)

A classification of bisimilarities for general Markov decision processes
by: Moroni, Martín Santiago, et al.
Published: (2024)

The complexity of bisimilarity on pointmass processes
by: Moroni, Martín Santiago, et al.
Published: (2026)

Information vs Dimension -- an Algorithmic Perspective
by: Reimann, Jan
Published: (2024)

The equational theory of the Weihrauch lattice with (iterated) composition
by: Pradic, Cécilia
Published: (2024)

Parametrized complexity of relations between multidimensional subshifts
by: Carrasco-Vargas, Nicanor, et al.
Published: (2025)

A Cut-Free Sequent Calculus for the Analysis of Finite-Trace Properties in Concurrent Systems
by: Fusco, Ludovico, et al.
Published: (2025)

Insignificant Choice Polynomial Time: A Logic Capturing PTIME
by: Schewe, Klaus-Dieter
Published: (2020)

Normalization properties of $λμ$-calculus using realizability semantics
by: Battyanyi, Peter, et al.
Published: (2023)

The Fractal Logic of Phi-adic Recursion
by: Rosko, Milan
Published: (2025)

Strong Kurtz Randomness and Binary Expansions of Reordered Computable Numbers
by: Hertling, Peter, et al.
Published: (2025)

Dilations and information flow axioms in categorical probability
by: Fritz, Tobias, et al.
Published: (2022)

Finitely Bounded Homogeneity Turned Inside-Out
by: Rydval, Jakub
Published: (2021)

From Witness-Space Sharpness To Family-Pointwise Exactness For The Solvability Complexity Index
by: Sorg, Christopher
Published: (2026)

Algebraic Proof Theory for Infinitary Action Logic
by: Fussner, Wesley, et al.
Published: (2025)

Extending the Limit Theorem of Barmpalias and Lewis-Pye to all reals
by: Titov, Ivan
Published: (2024)

On the incomputability of computable dimension
by: Staiger, Ludwig
Published: (2019)

The Solver's Paradox in Formal Problem Spaces
by: Rosko, Milan
Published: (2025)

Preservation theorems on sparse classes revisited
by: Dawar, Anuj, et al.
Published: (2024)

Adversarial Barrier in Uniform Class Separation
by: Rosko, Milan
Published: (2025)

Solovay reducibility implies S2a-reducibility
by: Titov, Ivan
Published: (2024)

A total Solovay reducibility and totalizing of the notion of speedability
by: Merkle, Wolfgang, et al.
Published: (2024)

Arithmetics within the Linear Time Hierarchy
by: Pollett, Chris
Published: (2025)

Infinite Eulerian paths are computable on graphs with vertices of infinite degree
by: Carrasco-Vargas, Nicanor
Published: (2023)

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning
by: Kattermann, David, et al.
Published: (2025)

Regainingly approximable numbers and sets
by: Hertling, Peter, et al.
Published: (2023)

Languages given by Finite Automata over the Unary Alphabet
by: Czerwiński, Wojciech, et al.
Published: (2023)

The complexity of being monitorable
by: Camerlo, Riccardo, et al.
Published: (2026)

From Gödel incompleteness to the consistency of circuit lower bounds
by: Atserias, Albert, et al.
Published: (2026)

Languages of Words of Low Automatic Complexity Are Hard to Compute
by: Chen, Joey, et al.
Published: (2025)

Exploring P versus NP
by: Tang, Jian-Gang
Published: (2022)

Complexities of Well-Quasi-Ordered Substructural Logics
by: Galatos, Nikolaos, et al.
Published: (2025)