On the public citation graph
Effective procedures and computable functions
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.1007/bf00974186openalex-snapshot
The Church-Turing thesis and effective mundane procedures
inferredcites →https://doi.org/10.1016/b978-044450423-4/50007-3openalex-snapshot
Systems of logic based on ordinals
inferredcites →https://doi.org/10.1093/oso/9780198250791.003.0017openalex-snapshot
Computing Machinery and Intelligence (1950)
inferredcites →https://doi.org/10.1145/300307.1040360openalex-snapshot
Elements of the Theory of Computation
inferredcites →https://doi.org/10.2307/2313471openalex-snapshot
Computation: Finite and Infinite Machines.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11047-010-9225-xopenalex-snapshot
Unwinding performance and power on Colossus, an unconventional computer
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.12.011openalex-snapshot
Hypercomputation by definition
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.12.012openalex-snapshot
The concept of computability
inferred← citeshttps://doi.org/10.1023/a:1008230900201openalex-snapshot
Thinking and Computing: Computers as Special Kinds of Signs
inferred← citeshttps://doi.org/10.1023/a:1011251504223openalex-snapshot
Recipes, Algorithms, and Programs
inferred← citeshttps://doi.org/10.1023/a:1015634729532openalex-snapshot
Reflections on Gödel's and Gandy's Reflections on Turing's Thesis
inferred← citeshttps://doi.org/10.1023/a:1015638814511openalex-snapshot
The Scope of Turing's Analysis of Effective Procedures
inferred← citeshttps://doi.org/10.1023/a:1015651216328openalex-snapshot
Toward a Formal Philosophy of Hypercomputation
inferred← citeshttps://doi.org/10.1023/a:1015659418145openalex-snapshot
Is There a Nonrecursive Decidable Equational Theory?
inferred← citeshttps://doi.org/10.1080/03640210801897856openalex-snapshot
The Tractable Cognition Thesis
inferred← citeshttps://doi.org/10.1093/philmat/nkr001openalex-snapshot
How Not To Use the Church-Turing Thesis Against Platonism
inferred← citeshttps://doi.org/10.2307/2183531openalex-snapshot
On the Possibility of Completing an Infinite Process
inferred← citeshttps://doi.org/10.3233/ao-2008-0058openalex-snapshot
The philosophy of computer science
inferred← citeshttps://doi.org/10.4000/philosophiascientiae.772openalex-snapshot
Cleland on Church’s Thesis and the Limits of Computation
inferred← citeshttps://doi.org/10.5840/teachphil200528443openalex-snapshot
Philosophy of Computer Science
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.