On the public citation graph
On computable enumerations
0 signed · 25 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.1002/malq.19640100203openalex-snapshot
STANDARD CLASSES OF RECURSIVELY ENUMERABLE SETS
inferredcites →https://doi.org/10.1007/bf01040653openalex-snapshot
Enumeration of families of general recursive functions
inferredcites →https://doi.org/10.1090/s0002-9939-1964-0174479-5openalex-snapshot
Gödel numberings versus Friedberg numberings
inferredcites →https://doi.org/10.1090/s0002-9947-1956-0085187-3openalex-snapshot
Degrees of Computability
inferredcites →https://doi.org/10.1305/ndjfl/1093957732openalex-snapshot
A stronger form of a theorem of Friedberg.
inferredcites →https://doi.org/10.1515/9781400882007openalex-snapshot
Theory of Formal Systems. (AM-47)
inferredcites →https://doi.org/10.2307/2270617openalex-snapshot
On the indexing of classes of recursively enumerable sets
inferredcites →https://doi.org/10.2307/2964290openalex-snapshot
Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2001.2922openalex-snapshot
Learning by the Process of Elimination
inferred← citeshttps://doi.org/10.1007/978-0-387-69245-6_3openalex-snapshot
Computability and Computable Models
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-642-30870-3_51openalex-snapshot
Characteristics of Minimal Effective Programming Systems
inferred← citeshttps://doi.org/10.1007/bf01877237openalex-snapshot
Enumerations of families of general recursive functions
inferred← citeshttps://doi.org/10.1007/bf02218608openalex-snapshot
On discrete families of recursively enumerable sets
inferred← citeshttps://doi.org/10.1007/bf02679757openalex-snapshot
Completely recursively enumerable sets
inferred← citeshttps://doi.org/10.1007/s10469-012-9161-1openalex-snapshot
Computably enumerable sets and related issues
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00036-copenalex-snapshot
A learning-theoretic characterization of classes of recursive functions
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90076-popenalex-snapshot
Some effectively infinite classes of enumerations
inferred← citeshttps://doi.org/10.1070/rm2000v055n06abeh000354openalex-snapshot
Yuri Leonidovich Ershov (on his 60th birthday)
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/s0037446621010031openalex-snapshot
On Universal Pairs in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1142/9789811278631_0004openalex-snapshot
Isomorphism Types of Rogers Semilattices in the Analytical Hierarchy
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.