On the public citation graph

On subrecursive representability of irrational numbers

https://doi.org/10.3233/com-160063
0 signed · 34 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.1002/1521-3870(200210)48:1+<91::aid-malq91>3.0.co;2-lopenalex-snapshot
Computability of Real Numbers by Using a Given Class of Functions in the Set of the Natural Numbers
inferredcites →https://doi.org/10.1002/malq.19720180405openalex-snapshot
A Classification of the Recursive Functions
inferredcites →https://doi.org/10.1002/malq.201400013openalex-snapshot
Continued fractions of primitive recursive real numbers
inferredcites →https://doi.org/10.1007/11494645_64openalex-snapshot
Computable Analysis
inferredcites →https://doi.org/10.1007/978-3-0348-9259-9_2openalex-snapshot
Nicht Konstruktiv Beweisbare Sätze der Analysis
inferredcites →https://doi.org/10.1007/978-3-662-21963-8_17openalex-snapshot
Information content and computational complexity of recursive sets
inferredcites →https://doi.org/10.1007/bf01744572openalex-snapshot
On the definitions of some complexity classes of real numbers
inferredcites →https://doi.org/10.1007/pl00003845openalex-snapshot
Subrecursive degrees and fragments of Peano Arithmetic
inferredcites →https://doi.org/10.1007/s001530050086openalex-snapshot
A jump operator on honest subrecursive degrees
inferredcites →https://doi.org/10.1016/0304-3975(86)90154-4openalex-snapshot
On the continued fraction representation of computable real numbers
inferredcites →https://doi.org/10.1016/j.apal.2011.11.004openalex-snapshot
Streamlined subrecursive degree theory
inferredcites →https://doi.org/10.1016/s0019-9958(74)80039-2openalex-snapshot
The honest subrecursive classes are a lattice
inferredcites →https://doi.org/10.1016/s0022-0000(72)80032-1openalex-snapshot
Augmented loop languages and classes of computable functions
inferredcites →https://doi.org/10.1016/s0022-0000(75)80039-0openalex-snapshot
On the density of honest subrecursive classes
inferredcites →https://doi.org/10.1017/9781316716939.018openalex-snapshot
Information content and computational complexity of recursive sets
inferredcites →https://doi.org/10.1093/logcom/exq050openalex-snapshot
Formula2-computable real numbers
inferredcites →https://doi.org/10.2307/2267043openalex-snapshot
Nicht konstruktiv beweisbare Sätze der Analysis
inferredcites →https://doi.org/10.4064/fm-49-2-105-118openalex-snapshot
On primitive recursive real numbers
inferredcites →https://doi.org/10.5948/upo9780883859261openalex-snapshot
Continued Fractions

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-51466-2_7openalex-snapshot
On the Complexity of Conversion Between Classic Real Number Representations
inferred← citeshttps://doi.org/10.1007/978-3-030-80049-9_23openalex-snapshot
Dedekind Cuts and Long Strings of Zeros in Base Expansions
inferred← citeshttps://doi.org/10.1007/978-3-030-80049-9_28openalex-snapshot
On Subrecursive Representation of Irrational Numbers: Contractors and Baire Sequences
inferred← citeshttps://doi.org/10.1007/978-3-031-36978-0_11openalex-snapshot
Elementarily Traceable Irrational Numbers
inferred← citeshttps://doi.org/10.1007/978-3-031-36978-0_13openalex-snapshot
Subrecursive Graphs of Representations of Irrational Numbers
inferred← citeshttps://doi.org/10.1007/978-3-031-95908-0_16openalex-snapshot
On S-Degrees of Some Representations of Irrational Numbers
inferred← citeshttps://doi.org/10.1007/978-3-319-94418-0_20openalex-snapshot
On General Sum Approximations of Irrational Numbers
inferred← citeshttps://doi.org/10.1016/j.apal.2020.102893openalex-snapshot
Computable irrational numbers with representations of surprising complexity
inferred← citeshttps://doi.org/10.1017/bsl.2025.10085openalex-snapshot
ON REPRESENTATIONS OF IRRATIONAL NUMBERS AND THE COMPUTATIONAL COMPLEXITY OF CONVERTING BETWEEN SUCH REPRESENTATIONS
inferred← citeshttps://doi.org/10.1101/2023.09.27.559729openalex-snapshot
Unifying evolutionary dynamics: a set theory exploration of symmetry and interaction
inferred← citeshttps://doi.org/10.1177/22113568261468518openalex-snapshot
Avoiding the subrecursive cone of Cauchy sequences
inferred← citeshttps://doi.org/10.3233/com-170081openalex-snapshot
On subrecursive representability of irrational numbers, part II
inferred← citeshttps://doi.org/10.3233/com-230469openalex-snapshot
Interplay between insertion of zeros and the complexity of Dedekind cuts
inferred← citeshttps://doi.org/10.48550/arxiv.1804.05330openalex-snapshot
Subrecursive Approximations of Irrational Numbers by Variable Base Sums
inferred← citeshttps://doi.org/10.60063/gsu.fmi.109.41-55openalex-snapshot
Subrecursive incomparability of the graphs of standard and dual Baire sequences
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.