On the public citation graph

Computability: a mathematical sketchbook

https://doi.org/10.5860/choice.31-6098
0 signed · 20 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 points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.3332798openalex-extracted
Approaching the Singularity Behind the Veil of Incomputability: On Algorithmic Governance, the Economist-as-Expert, and the Piecemeal Circumnavigation of the Administrative State
inferred← citeshttps://doi.org/10.3217/jucs-016-14-1912openalex-extracted
A Heuristic Approach to Positive Root Isolation for Multiple Power Sums
inferred← citeshttps://doi.org/10.1007/11549345_65openalex-snapshot
On Beta-Shifts Having Arithmetical Languages
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_48openalex-snapshot
Effective category and measure in abstract complexity theory
inferred← citeshttps://doi.org/10.1007/978-3-662-07675-0_1openalex-snapshot
Complexity: A Language-Theoretic Point of View
inferred← citeshttps://doi.org/10.1007/978-94-017-3327-4_9openalex-snapshot
Strong Determinism vs. Computability
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00050-6openalex-snapshot
On recursive bounds for the exceptional values in speed-up
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00066-6openalex-snapshot
Effective category and measure in abstract complexity theory
inferred← citeshttps://doi.org/10.1016/j.ic.2006.02.001openalex-snapshot
Weakly complete axiomatization of exogenous quantum propositional logic
inferred← citeshttps://doi.org/10.1016/j.spl.2003.12.002openalex-snapshot
A computable version of the random signs problem and Kolmogorov complexity
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80013-xopenalex-snapshot
Chapter 12 A bibliography of recursive analysis and recursive topology
inferred← citeshttps://doi.org/10.1016/s0304-4068(98)00063-9openalex-snapshot
Computable preference and utility
inferred← citeshttps://doi.org/10.1023/a:1008369211484openalex-snapshot
A New Model of Computation for Learning Vision Modules from Examples
inferred← citeshttps://doi.org/10.1023/a:1008373328323openalex-snapshot
Madura: A Language for Learning Vision Programs from Examples
inferred← citeshttps://doi.org/10.1080/10586458.2002.10504481openalex-snapshot
Computing a Glimpse of Randomness
inferred← citeshttps://doi.org/10.1093/jigpal/jzp003openalex-snapshot
Economic theory and the Alternative Set Theory AFA-+AD+DC
inferred← citeshttps://doi.org/10.1142/s0219199722500663openalex-snapshot
Relative order and spectrum in free and related groups
inferred← citeshttps://doi.org/10.17771/pucrio.acad.46898openalex-snapshot
EM TORNO DA TESE DE CHURCH E DO INTUICIONISMO LÓGICO
inferred← citeshttps://doi.org/10.48550/arxiv.0910.3191openalex-snapshot
h-cobordism and s-cobordism Theorems: Transfer over Semialgebraic and Nash categories, Uniform bound and Effectiveeness
inferred← citeshttps://doi.org/10.48550/arxiv.2007.09847openalex-snapshot
Quantum Immortality and Non-Classical Logic
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.