On the public citation graph
Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
0 signed · 237 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1090/s0002-9904-1944-08111-1openalex-snapshot
Recursively enumerable sets of positive integers and their decision problems
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.19620080313openalex-snapshot
Recursively Enumerable Sets and Retracing Functions
inferred← citeshttps://doi.org/10.1002/malq.19640100802openalex-snapshot
A STRUCTURAL CRITERION FOR RECURSIVE ENUMERATION WITHOUT REPETITION
inferred← citeshttps://doi.org/10.1002/malq.19650110303openalex-snapshot
Enumeration of Recursive Sets By Turing Machine
inferred← citeshttps://doi.org/10.1002/malq.19650110305openalex-snapshot
On Recursive Enumeration Without Repetition
inferred← citeshttps://doi.org/10.1002/malq.19660120125openalex-snapshot
Classes of Recursively Enumerable Sets and Degrees of Unsolvability
inferred← citeshttps://doi.org/10.1002/malq.19700160208openalex-snapshot
Some Properties of Recursively Inseparable Sets
inferred← citeshttps://doi.org/10.1002/malq.19740200808openalex-snapshot
Die Struktur des Halbverbandes der Effektiven Numerierungen
inferred← citeshttps://doi.org/10.1002/malq.19760220125openalex-snapshot
The Structure of the Lattice of Recursive Sets
inferred← citeshttps://doi.org/10.1002/malq.19770232505openalex-snapshot
Decomposition of Gödelnumberings into Friedbergnumberings
inferred← citeshttps://doi.org/10.1002/malq.19780241303openalex-snapshot
On the Simplicity of Busy Beaver Sets
inferred← citeshttps://doi.org/10.1002/malq.19790251908openalex-snapshot
Direct Summands of Recursively Enumerable Vector Spaces
inferred← citeshttps://doi.org/10.1002/malq.19800261403openalex-snapshot
Zerlegung mit Vergleichsbedingungen Einer Gödelnumerierung
inferred← citeshttps://doi.org/10.1002/malq.19800262804openalex-snapshot
Reduzierbarkeit von Berechenbaren Numerierungen von P1
inferred← citeshttps://doi.org/10.1002/malq.19800263206openalex-snapshot
Universalität von Berechenbaren Numerierungen von Partiell Rekursiven Funktionen
inferred← citeshttps://doi.org/10.1002/malq.19820282708openalex-snapshot
Inductive Inference and Computable One‐One Numberings
inferred← citeshttps://doi.org/10.1002/malq.19840300904openalex-snapshot
CONNECTIONS BETWEEN IDENTIFYING FUNCTIONALS, STANDARDIZING OPERATIONS, AND COMPUTABLE NUMBERINGS
inferred← citeshttps://doi.org/10.1002/malq.19850312903openalex-snapshot
Anti‐Mitotic Recursively Enumerable Sets
inferred← citeshttps://doi.org/10.1002/malq.19900360403openalex-snapshot
Jumps of nontrivial splittings of recursively enumerable sets
inferred← citeshttps://doi.org/10.1002/malq.19950410311openalex-snapshot
Some New Lattice Constructions in High R. E. Degrees
inferred← citeshttps://doi.org/10.1002/malq.200310013openalex-snapshot
Topological aspects of numberings
inferred← citeshttps://doi.org/10.1002/malq.201010022openalex-snapshot
On a positive set theory with inequality
inferred← citeshttps://doi.org/10.1002/malq.202200035openalex-snapshot
Extremal numberings and fixed point theorems
inferred← citeshttps://doi.org/10.1006/aima.1997.1687openalex-snapshot
Coding in the Partial Order of Enumerable Sets
inferred← citeshttps://doi.org/10.1006/inco.2001.2922openalex-snapshot
Learning by the Process of Elimination
inferred← citeshttps://doi.org/10.1006/jcom.2000.0561openalex-snapshot
Weakly Computable Real Numbers
inferred← citeshttps://doi.org/10.1007/3-540-08138-0_20openalex-snapshot
Struktur von Programmbündeln
inferred← citeshttps://doi.org/10.1007/3-540-19020-1_20openalex-snapshot
Computable one-to-one enumerations of effective domains
inferred← citeshttps://doi.org/10.1007/3-540-58520-6_81openalex-snapshot
Language learning from good examples
inferred← citeshttps://doi.org/10.1007/3-540-62685-9_24openalex-snapshot
Control structures in hypothesis spaces: The influence on learning
inferred← citeshttps://doi.org/10.1007/978-0-387-68546-5_2openalex-snapshot
Computability and Numberings
inferred← citeshttps://doi.org/10.1007/978-3-030-06170-8_1openalex-snapshot
Theoretical Computer Science: Computability, Decidability and Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-19071-2_21-1openalex-snapshot
Countable Nonstandard Models: Following Skolem’s Approach
inferred← citeshttps://doi.org/10.1007/978-3-030-22996-2_9openalex-snapshot
Bounded Reducibility for Computable Numberings
inferred← citeshttps://doi.org/10.1007/978-3-030-59267-7_1openalex-snapshot
Semilattices of Punctual Numberings
inferred← citeshttps://doi.org/10.1007/978-3-031-40846-5_21openalex-snapshot
Countable Nonstandard Models: Following Skolem’s Approach
inferred← citeshttps://doi.org/10.1007/978-3-031-64309-5_11openalex-snapshot
On Arithmetical Numberings in Reverse Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-319-43669-2_5openalex-snapshot
Some Recent Research Directions in the Computably Enumerable Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_13openalex-snapshot
Weakly Represented Families in Reverse Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_31openalex-snapshot
On Splits of Computably Enumerable Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-75225-7_10openalex-snapshot
Learning in Friedberg Numberings
inferred← citeshttps://doi.org/10.1007/978-3-540-75225-7_9openalex-snapshot
Prescribed Learning of R.E. Classes
inferred← citeshttps://doi.org/10.1007/978-3-540-87987-9_35openalex-snapshot
Numberings Optimal for Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_4openalex-snapshot
Hypothesis Spaces for Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_28openalex-snapshot
Index Sets and Universal Numberings
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_6openalex-snapshot
Numberings and Randomness
inferred← citeshttps://doi.org/10.1007/978-3-642-03409-1_5openalex-snapshot
Independence Results for n-Ary Recursion Theorems
inferred← citeshttps://doi.org/10.1007/978-3-642-30870-3_51openalex-snapshot
Characteristics of Minimal Effective Programming Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-30870-3_66openalex-snapshot
Game Arguments in Computability Theory and Algorithmic Information Theory
inferred← citeshttps://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferred← citeshttps://doi.org/10.1007/bf01098317openalex-snapshot
Extension of partial recursive functions and functions with a recursive graph
inferred← citeshttps://doi.org/10.1007/bf01111167openalex-snapshot
The minimum of two regressive isols
inferred← citeshttps://doi.org/10.1007/bf01669607openalex-snapshot
Computable single-valued numerations
inferred← citeshttps://doi.org/10.1007/bf01762189openalex-snapshot
Optimal enumerations and optimal gödel numberings
inferred← citeshttps://doi.org/10.1007/bf01792984openalex-snapshot
Some applications of computable one-one numberings
inferred← citeshttps://doi.org/10.1007/bf01976264openalex-snapshot
Recursively enumerable classes and their application to recursive sequences of formal theories
inferred← citeshttps://doi.org/10.1007/bf02127967openalex-snapshot
Learning-theoretic perspectives of acceptable numberings
inferred← citeshttps://doi.org/10.1007/bf02219834openalex-snapshot
On the reducibility of computable numerations
inferred← citeshttps://doi.org/10.1007/bf02671553openalex-snapshot
Generalized computable numerations and nontrivial rogers semilattices
inferred← citeshttps://doi.org/10.1007/bfb0019357openalex-snapshot
Inductive inference of recursive functions: Qualitative theory
inferred← citeshttps://doi.org/10.1007/bfb0066780openalex-snapshot
Admissible ordinals and priority arguments
inferred← citeshttps://doi.org/10.1007/bfb0076226openalex-snapshot
Generic objects in recursion theory
inferred← citeshttps://doi.org/10.1007/bfb0083664openalex-snapshot
Recursively enumerable sets in models of Σ2 collection
inferred← citeshttps://doi.org/10.1007/bfb0086122openalex-snapshot
Recursive enumeration without repetition revisited
inferred← citeshttps://doi.org/10.1007/s00153-008-0065-7openalex-snapshot
Effectively closed sets and enumerations
inferred← citeshttps://doi.org/10.1007/s00153-014-0402-yopenalex-snapshot
Friedberg numberings in the Ershov hierarchy
inferred← citeshttps://doi.org/10.1007/s00153-018-0638-zopenalex-snapshot
Degree spectra of real closed fields
inferred← citeshttps://doi.org/10.1007/s00153-022-00842-6openalex-snapshot
Complexity of $$\Sigma ^0_n$$-classifications for definable subsets
inferred← citeshttps://doi.org/10.1007/s00224-025-10222-1openalex-snapshot
Control Structures in Computable Numberings and the Completion Operator
inferred← citeshttps://doi.org/10.1007/s10469-012-9161-1openalex-snapshot
Computably enumerable sets and related issues
inferred← citeshttps://doi.org/10.1007/s10469-015-9349-2openalex-snapshot
Friedberg Numberings in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1007/s10469-016-9366-9openalex-snapshot
Orbits of Maximal Vector Spaces
inferred← citeshttps://doi.org/10.1007/s10469-019-09540-4openalex-snapshot
Computable Numberings of Families of Infinite Sets
inferred← citeshttps://doi.org/10.1007/s10469-019-09559-7openalex-snapshot
Classifications of Definable Subsets
inferred← citeshttps://doi.org/10.1007/s10469-020-09599-4openalex-snapshot
Semidecidable Numberings in Admissible Sets
inferred← citeshttps://doi.org/10.1007/s10469-021-09635-xopenalex-snapshot
Some Properties of the Upper Semilattice of Computable Families of Computably Enumerable Sets
inferred← citeshttps://doi.org/10.1007/s10469-026-09847-zopenalex-snapshot
Friedberg Numberings on Admissible Sets
inferred← citeshttps://doi.org/10.1007/s10849-025-09430-2openalex-snapshot
A Family Whose Computable Numberings are All Complete
inferred← citeshttps://doi.org/10.1007/s10958-020-04781-6openalex-snapshot
On One-to-One Numberings of the Family of All $$ {\Sigma}_2^1 $$-Sets
inferred← citeshttps://doi.org/10.1016/0003-4843(71)90002-7openalex-snapshot
Admissible ordinals and lattices of α-R.E. sets
inferred← citeshttps://doi.org/10.1016/0003-4843(74)90004-7openalex-snapshot
Maximal α-R.E. sets and their complements
inferred← citeshttps://doi.org/10.1016/0003-4843(76)90005-xopenalex-snapshot
Hyperhypersimple α-r.e. sets
inferred← citeshttps://doi.org/10.1016/0003-4843(78)90020-7openalex-snapshot
On elementary theories of some lattices or α-recursively enumerable sets
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/0022-0000(89)90023-8openalex-snapshot
Honest polynomial time reducibilities and the P=?NP problem
inferred← citeshttps://doi.org/10.1016/0168-0072(89)90043-2openalex-snapshot
Hyperhypersimple sets and Δ2 systems
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90076-popenalex-snapshot
Some effectively infinite classes of enumerations
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90092-ropenalex-snapshot
Friedberg splittings of recursively enumerable sets
inferred← citeshttps://doi.org/10.1016/0304-3975(78)90042-7openalex-snapshot
Data representation and computational complexity
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90061-0openalex-snapshot
Comparison of identification criteria for machine inductive inference
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90141-4openalex-snapshot
An easy priority-free proof of a theorem of Friedberg
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90032-dopenalex-snapshot
Computable one-to-one enumerations of effective domains
inferred← citeshttps://doi.org/10.1016/b978-0-12-386980-7.50002-2openalex-snapshot
On Computable Numbers, with an Application to the Entscheidungsproblem – A Correction
inferred← citeshttps://doi.org/10.1016/b978-0-12-417750-5.50006-3openalex-snapshot
COMPUTATIONALLY COMPLEX AND PSEUDO-RANDOM ZERO-ONE VALUED FUNCTIONS††Portions of this work were carried out at Carngie-Mellon University, while the authors were in the Department of Computer Science. Portions of these results were reported in preliminary form in [1].
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50010-1openalex-snapshot
Degrees of Unsolvability
inferred← citeshttps://doi.org/10.1016/b978-0-7204-2233-7.50054-xopenalex-snapshot
A BIBLIOGRAPHY OF THE THEORY OF MODELS
inferred← citeshttps://doi.org/10.1016/j.apal.2019.102716openalex-snapshot
Reductions between types of numberings
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.08.017openalex-snapshot
Enumerations of Π10 Classes: Acceptability and Decidable Classes
inferred← citeshttps://doi.org/10.1016/j.geb.2010.06.008openalex-snapshot
Preference aggregation theory without acyclicity: The core without majority dissatisfaction
inferred← citeshttps://doi.org/10.1016/j.ic.2008.03.001openalex-snapshot
Learning in Friedberg numberings
inferred← citeshttps://doi.org/10.1016/j.ic.2010.11.016openalex-snapshot
Hypothesis spaces for learning
inferred← citeshttps://doi.org/10.1016/j.ic.2014.02.002openalex-snapshot
Things that can be made into themselves
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104590openalex-snapshot
Learning families of algebraic structures from informant
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2020.04.039openalex-snapshot
Enumerating abelian p-groups
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.06.007openalex-snapshot
Learning with belief levels
inferred← citeshttps://doi.org/10.1016/j.jcss.2009.08.001openalex-snapshot
Numberings optimal for learning
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.07.001openalex-snapshot
Index sets and universal numberings
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.01.011openalex-snapshot
Prescribed learning of r.e. classes
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.054openalex-snapshot
Partial combinatory algebra and generalized numberings
inferred← citeshttps://doi.org/10.1016/s0022-0000(75)80015-8openalex-snapshot
Some clarifications of the concept of a Garden-of-Eden configuration
inferred← citeshttps://doi.org/10.1016/s0022-0000(75)80016-xopenalex-snapshot
Splitting a Context-Sensitive Set
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70934-0openalex-snapshot
Lattices of α-Recursively Enumerable Sets
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71230-8openalex-snapshot
Some Reasons for Generalizing Recursion Theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70511-7openalex-snapshot
The Universal Splitting Property: I
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80012-8openalex-snapshot
Chapter 11 A bibliography of recursive algebra and recursive model theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80047-5openalex-snapshot
Chapter 14 Computability theory and linear orderings
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00385-6openalex-snapshot
Control structures in hypothesis spaces: the influence on learning
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00028-7openalex-snapshot
Kolmogorov entropy in the context of computability theory
inferred← citeshttps://doi.org/10.1017/bsl.2014.14openalex-snapshot
NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS
inferred← citeshttps://doi.org/10.1017/bsl.2020.46openalex-snapshot
COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS
inferred← citeshttps://doi.org/10.1017/cbo9780511750779openalex-snapshot
A Framework for Priority Arguments
inferred← citeshttps://doi.org/10.1017/cbo9781139171496.002openalex-snapshot
Prologue. Prerequisites and notation
inferred← citeshttps://doi.org/10.1017/cbo9781139171496.004openalex-snapshot
Generating computable functions
inferred← citeshttps://doi.org/10.1017/cbo9781139171496.005openalex-snapshot
Other approaches to computability: Church's thesis
inferred← citeshttps://doi.org/10.1017/cbo9781139171496.006openalex-snapshot
Numbering computable functions
inferred← citeshttps://doi.org/10.1017/cbo9781139171496.008openalex-snapshot
Decidability, undecidability and partial decidability
inferred← citeshttps://doi.org/10.1017/cbo9781139171496.009openalex-snapshot
Recursive and recursively enumerable sets
inferred← citeshttps://doi.org/10.1017/cbo9781139171496.010openalex-snapshot
Arithmetic and Gödel's incompleteness theorem
inferred← citeshttps://doi.org/10.1017/cbo9781139171496.011openalex-snapshot
Reducibility and degrees
inferred← citeshttps://doi.org/10.1017/cbo9781139171496.012openalex-snapshot
Effective operations on partial functions
inferred← citeshttps://doi.org/10.1017/cbo9781139171496.013openalex-snapshot
The second Recursion theorem
inferred← citeshttps://doi.org/10.1017/cbo9781139171496.014openalex-snapshot
Complexity of computation
inferred← citeshttps://doi.org/10.1017/jsl.2015.77openalex-snapshot
COMPARING TWO VERSIONS OF THE REALS
inferred← citeshttps://doi.org/10.1017/jsl.2018.68openalex-snapshot
A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE
inferred← citeshttps://doi.org/10.1017/jsl.2023.77openalex-snapshot
NOTES ON SACKS’ SPLITTING THEOREM
inferred← citeshttps://doi.org/10.1017/s0027763000001604openalex-snapshot
Maximal sets and fragments of Peano arithmetic
inferred← citeshttps://doi.org/10.1017/s107989860001060xopenalex-snapshot
2012–2013 Winter Meeting of The Association for Symbolic Logic
inferred← citeshttps://doi.org/10.1023/a:1015352513117openalex-snapshot
Friedberg Numberings of Families of n-Computably Enumerable Sets
inferred← citeshttps://doi.org/10.1023/a:1018920425684openalex-snapshot
Identifying nearly minimal Gödel numbers from additional information
inferred← citeshttps://doi.org/10.1023/a:1018955906119openalex-snapshot
Learning recursive languages from good examples
inferred← citeshttps://doi.org/10.1080/00207167708803129openalex-snapshot
Syntax and semantics of universal programming languages
inferred← citeshttps://doi.org/10.1080/03081077808960684openalex-snapshot
INPUT/OUTPUT CODINGS AND TRANSITION FUNCTIONS IN EFFECTIVE SYSTEMS
inferred← citeshttps://doi.org/10.1090/s0002-9904-1966-11416-7openalex-snapshot
Metarecursively enumerable sets and admissible ordinals
inferred← citeshttps://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferred← citeshttps://doi.org/10.1090/s0002-9939-1964-0174479-5openalex-snapshot
Gödel numberings versus Friedberg numberings
inferred← citeshttps://doi.org/10.1090/s0002-9939-1964-0179079-9openalex-snapshot
On Reducibility by Recursive Functions
inferred← citeshttps://doi.org/10.1090/s0002-9939-1966-0207556-2openalex-snapshot
A Theorem on Recursively Enumerable Classes and Splinters
inferred← citeshttps://doi.org/10.1090/s0002-9939-1968-0221933-7openalex-snapshot
Complete Recursively Enumerable Sets
inferred← citeshttps://doi.org/10.1090/s0002-9947-1966-0201299-1openalex-snapshot
Post’s problem, admissible ordinals, and regularity
inferred← citeshttps://doi.org/10.1090/s0002-9947-1967-0215714-1openalex-snapshot
Two Theorems on Hyperhypersimple Sets
inferred← citeshttps://doi.org/10.1090/s0002-9947-1968-0227009-1openalex-snapshot
On the Lattice of Recursively Enumerable Sets
inferred← citeshttps://doi.org/10.1090/s0002-9947-1969-0241295-4openalex-snapshot
On the Degrees of Index Sets. II
inferred← citeshttps://doi.org/10.1090/s0002-9947-1969-0249297-9openalex-snapshot
Uniformly reflexive structures: On the nature of gödelizations and relative computability
inferred← citeshttps://doi.org/10.1090/s0002-9947-1970-0265157-xopenalex-snapshot
Recursive functions modulo 𝐶𝑂-𝑟-maximal sets
inferred← citeshttps://doi.org/10.1090/s0002-9947-1974-0332458-xopenalex-snapshot
Maximal 𝛼-r.e. sets
inferred← citeshttps://doi.org/10.1090/s0002-9947-1980-0549153-7openalex-snapshot
A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets
inferred← citeshttps://doi.org/10.1090/s0002-9947-1985-0797064-9openalex-snapshot
The Degrees of R.E. Sets Without the Universal Splitting Property
inferred← citeshttps://doi.org/10.1090/s0002-9947-1987-0902785-2openalex-snapshot
Hyperarithmetical Index Sets in Recursion Theory
inferred← citeshttps://doi.org/10.1090/s0273-0979-1981-14863-1openalex-snapshot
Strong reducibilities
inferred← citeshttps://doi.org/10.1093/logcom/exx030openalex-snapshot
Implementing fragments of ZFC within an r.e. Universe
inferred← citeshttps://doi.org/10.1134/s0037446619020046openalex-snapshot
Rogers Semilattices for Families of Equivalence Relations in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1134/s105513442304003xopenalex-snapshot
Negative Numberings in Admissible Sets. I
inferred← citeshttps://doi.org/10.1134/s1995080224601383openalex-snapshot
Numberings on Admissible Structures over Equivalence Relations
inferred← citeshttps://doi.org/10.1137/0207003openalex-snapshot
Simple Gödel Numberings, Isomorphisms, and Programming Properties
inferred← citeshttps://doi.org/10.1137/070700577openalex-snapshot
Mitotic Classes in Inductive Inference
inferred← citeshttps://doi.org/10.1142/s0219061317500088openalex-snapshot
A Friedberg enumeration of equivalence structures
inferred← citeshttps://doi.org/10.1145/2287718.2287724openalex-snapshot
Arithmetic complexity via effective names for random sequences
inferred← citeshttps://doi.org/10.1145/2799561openalex-snapshot
On Approximate Decidability of Minimal Programs
inferred← citeshttps://doi.org/10.1145/2902945.2902956openalex-snapshot
SIGACT News Complexity Theory Column 90
inferred← citeshttps://doi.org/10.1145/2902945.2902957openalex-snapshot
A Brief on Short Descriptions
inferred← citeshttps://doi.org/10.1145/321812.321816openalex-snapshot
Further Results on the Problem of Finding Minimal Length Programs for Decision Tables
inferred← citeshttps://doi.org/10.1145/356914.356918openalex-snapshot
Inductive Inference: Theory and Methods
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.1145/800152.804914openalex-snapshot
A patent problem for abstract programming languages; machine-independent computations
inferred← citeshttps://doi.org/10.1201/b21197-9openalex-snapshot
Peano Arithmetic Models and Computability
inferred← citeshttps://doi.org/10.1215/00294527-2009-022openalex-snapshot
On the Degrees of Diagonal Sets and the Failure of the Analogue of a Theorem of Martin
showing the first 200 of 236 · page through all 236
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.