On the public citation graph

Optimal enumerations and optimal gödel numberings

0 signed · 49 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bfb0112458openalex-snapshot
Zufälligkeit und Wahrscheinlichkeit
inferredcites →https://doi.org/10.1016/s0019-9958(64)90131-7openalex-snapshot
A formal theory of inductive inference. Part II
inferredcites →https://doi.org/10.1016/s0019-9958(64)90223-2openalex-snapshot
A formal theory of inductive inference. Part I
inferredcites →https://doi.org/10.1016/s0019-9958(67)90546-3openalex-snapshot
On the size of machines
inferredcites →https://doi.org/10.1016/s0019-9958(72)90592-xopenalex-snapshot
Program size in restricted programming languages
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.2307/2964290openalex-snapshot
Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
inferredcites →https://doi.org/10.2307/2964292openalex-snapshot
Gödel numberings of partial recursive functions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/malq.19820282707openalex-snapshot
Topological Size of Sets of Partial Recursive Functions
inferred← citeshttps://doi.org/10.1007/11537311_40openalex-snapshot
On Approximating Real-World Halting Problems
inferred← citeshttps://doi.org/10.1007/3-540-11157-3_27openalex-snapshot
What are the gains of the theory of algorithms
inferred← citeshttps://doi.org/10.1007/3-540-58520-6_56openalex-snapshot
Identifying nearly minimal Gödel numbers from additional information
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_3openalex-snapshot
On the complexity of random strings
inferred← citeshttps://doi.org/10.1007/978-1-4612-4478-3_4openalex-snapshot
Juris Hartmanis: Fundamental Contributions to Isomorphism Problems
inferred← citeshttps://doi.org/10.1007/978-1-4612-4478-3_7openalex-snapshot
The Structure of Complete Degrees
inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_51openalex-snapshot
What Can be Efficiently Reduced to the K-Random Strings?
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_18openalex-snapshot
What Percentage of Programs Halt?
inferred← citeshttps://doi.org/10.1007/978-94-017-2973-4_16openalex-snapshot
Algorithmic Information Theory
inferred← citeshttps://doi.org/10.1007/bf01762186openalex-snapshot
Computational complexity of formal translations
inferred← citeshttps://doi.org/10.1007/s00037-017-0154-2openalex-snapshot
Short lists with short programs in short time
inferred← citeshttps://doi.org/10.1007/s00224-016-9726-9openalex-snapshot
On the Information Carried by Programs About the Objects they Compute
inferred← citeshttps://doi.org/10.1007/s00224-017-9773-xopenalex-snapshot
Short lists with short programs from programs of functions and strings
inferred← citeshttps://doi.org/10.1007/s10688-014-0052-1openalex-snapshot
Zipf’s law and L. Levin probability distributions
inferred← citeshttps://doi.org/10.1016/0022-0000(81)90024-6openalex-snapshot
The independence of control structures in abstract programming systems
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90132-3openalex-snapshot
A note on natural complete sets and Gödel numberings
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90001-4openalex-snapshot
Toward an abstract theory of data compression
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90140-9openalex-snapshot
Some remarks on witness functions for nonpolynomial and noncomplete sets in NP
inferred← citeshttps://doi.org/10.1016/j.apal.2005.06.003openalex-snapshot
What can be efficiently reduced to the Kolmogorov-random strings?
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.05.004openalex-snapshot
Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.08.001openalex-snapshot
Enumerations including laconic enumerators
inferred← citeshttps://doi.org/10.1016/s0019-9958(78)90062-1openalex-snapshot
Complexity dips in random infinite binary sequences
inferred← citeshttps://doi.org/10.1016/s0022-0000(74)80003-6openalex-snapshot
Approximations to the halting problem
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70025-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70326-4openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1017/s0960129511000508openalex-snapshot
Renormalisation and computation II: time cut-off and the Halting Problem
inferred← citeshttps://doi.org/10.1023/a:1018920425684openalex-snapshot
Identifying nearly minimal Gödel numbers from additional information
inferred← citeshttps://doi.org/10.1109/ccc.2013.19openalex-snapshot
Short Lists with Short Programs in Short Time
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9173984openalex-snapshot
Computability of the Zero-Error Capacity with Kolmogorov Oracle
inferred← citeshttps://doi.org/10.1109/memea.2007.4285165openalex-snapshot
Autonomous Monitoring of Adverse Responses to MedicationProlegomena to GAMUT-ARM Trial
inferred← citeshttps://doi.org/10.1137/0204001openalex-snapshot
On Simple Goedel Numberings and Translations
inferred← citeshttps://doi.org/10.1137/0207003openalex-snapshot
Simple Gödel Numberings, Isomorphisms, and Programming Properties
inferred← citeshttps://doi.org/10.1145/1008369.1008373openalex-snapshot
From the recursive function theory newsletter
inferred← citeshttps://doi.org/10.1145/800061.808770openalex-snapshot
Some structural properties of polynomial reducibilities and sets in NP
inferred← citeshttps://doi.org/10.1145/800113.803654openalex-snapshot
Simple Gödel numberings, translations, and the p-hierarchy (Preliminary Report)
inferred← citeshttps://doi.org/10.18910/7667openalex-snapshot
Program size, oracles, and the jump operation
inferred← citeshttps://doi.org/10.4213/faa3141openalex-snapshot
Закон Ципфа и вероятностные распределения Левина
inferred← citeshttps://doi.org/10.4310/jdg/1404912104openalex-snapshot
Kolmogorov complexity and the asymptotic bound for error-correcting codes
inferred← citeshttps://doi.org/10.48550/arxiv.2004.02844openalex-snapshot
Complexity of majorants
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.