On the public citation graph

Hilbert’s Tenth Problem and Paradigms of Computation

0 signed · 42 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.1007/978-3-030-64834-3openalex-snapshot
Advances in Cryptology – ASIACRYPT 2020
inferredcites →https://doi.org/10.1007/978-3-540-40061-5_26openalex-snapshot
On Diophantine Complexity and Statistical Zero-Knowledge Arguments
inferredcites →https://doi.org/10.1007/bf01091549openalex-snapshot
Existence of noneffectivizable estimates in the theory of exponential diophantine equations
inferredcites →https://doi.org/10.1007/bf01693980openalex-snapshot
A new proof of the theorem on exponential diophantine representation of enumerable sets
inferredcites →https://doi.org/10.1007/bf01700692openalex-snapshot
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
inferredcites →https://doi.org/10.1007/s00153-002-0162-yopenalex-snapshot
On the bounded version of Hilbert's tenth problem
inferredcites →https://doi.org/10.1007/s00605-006-0423-7openalex-snapshot
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
inferredcites →https://doi.org/10.1016/0022-0000(78)90044-2openalex-snapshot
NP-Complete decision problems for binary quadratics
inferredcites →https://doi.org/10.1016/0022-0000(83)90048-xopenalex-snapshot
A normal form for arithmetical representation of N P-sets
inferredcites →https://doi.org/10.1016/0168-0072(94)90014-0openalex-snapshot
A direct method for simulating partial recursive functions by Diophantine equations
inferredcites →https://doi.org/10.1016/0304-3975(76)90008-6openalex-snapshot
The equality problem for vector addition systems is undecidable
inferredcites →https://doi.org/10.1016/0304-3975(82)90076-7openalex-snapshot
An arithmetical characterization of NP
inferredcites →https://doi.org/10.1016/s0049-237x(08)71882-2openalex-snapshot
Exponential Diophantine Representation of Recursively Enumerable Sets
inferredcites →https://doi.org/10.1017/cbo9780511608858openalex-snapshot
Algorithmic Information Theory
inferredcites →https://doi.org/10.1080/00029890.1991.11995778openalex-snapshot
Proof of Recursive Unsolvability of Hilbert's Tenth Problem
inferredcites →https://doi.org/10.1090/conm/270/04368openalex-snapshot
Hilbert’s tenth problem: what was done and what is to be done
inferredcites →https://doi.org/10.1109/sfcs.1975.9openalex-snapshot
Computational complexity of decision procedures for polynomials
inferredcites →https://doi.org/10.1109/sfcs.1976.13openalex-snapshot
Diophantine complexity
inferredcites →https://doi.org/10.1145/321160.321170openalex-snapshot
Computability of Recursive Functions
inferredcites →https://doi.org/10.1145/321386.321395openalex-snapshot
A Machine-Independent Theory of the Complexity of Recursive Functions
inferredcites →https://doi.org/10.1147/rd.214.0350openalex-snapshot
Algorithmic Information Theory
inferredcites →https://doi.org/10.2307/1970289openalex-snapshot
The Decision Problem for Exponential Diophantine Equations
inferredcites →https://doi.org/10.2307/1970290openalex-snapshot
Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines
inferredcites →https://doi.org/10.2307/2002808openalex-snapshot
Computability and Unsolvability.
inferredcites →https://doi.org/10.2307/2266325openalex-snapshot
Arithmetical problems and recursively enumerable predicates
inferredcites →https://doi.org/10.2307/2274135openalex-snapshot
Register machine proof of the theorem on exponential diophantine representation of enumerable sets
inferredcites →https://doi.org/10.2307/2313471openalex-snapshot
Computation: Finite and Infinite Machines.
inferredcites →https://doi.org/10.2307/2322561openalex-snapshot
Computability and Unsolvability.
inferredcites →https://doi.org/10.2307/2371809openalex-snapshot
Formal Reductions of the General Combinatorial Decision Problem
inferredcites →https://doi.org/10.2307/2974971openalex-snapshot
Hilbert's Tenth Problem.
inferredcites →https://doi.org/10.4153/cmb-1961-031-9openalex-snapshot
An Informal Arithmetical Approach to Computability and Computation
inferredcites →https://doi.org/10.4153/cmb-1961-032-6openalex-snapshot
How to Program an Infinite Abacus

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-0-387-68546-5_4openalex-snapshot
Computation Paradigms in Light of Hilbert's Tenth Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-13257-5_3openalex-snapshot
On the Power of Recursive Word-Functions Without Concatenation
inferred← citeshttps://doi.org/10.1007/978-3-319-24246-0_9openalex-snapshot
A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings
inferred← citeshttps://doi.org/10.1007/978-3-319-41842-1_2openalex-snapshot
Martin Davis and Hilbert’s Tenth Problem
inferred← citeshttps://doi.org/10.1007/s10472-021-09764-0openalex-snapshot
The undecidability of proof search when equality is a logical connective
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.01.040openalex-snapshot
On post correspondence problem for letter monotonic languages
inferred← citeshttps://doi.org/10.1017/9781108781718.007openalex-snapshot
Aspects of Chaitin’s Omega
inferred← citeshttps://doi.org/10.1145/3448016.3457262openalex-snapshot
SIA
inferred← citeshttps://doi.org/10.14778/3342263.3342267openalex-snapshot
Automated verification of query equivalence using satisfiability modulo theories
inferred← citeshttps://doi.org/10.17077/etd.rnqkky2nopenalex-snapshot
Automated reasoning over string constraints
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.