A direct method for simulating partial recursive functions by Diophantine equations (Q1326783): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A sharp version of the bounded Matijasevich conjecture and the end-extension problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4161318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetical problems and recursively enumerable predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3346295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An explicit diophantine definition of the exponential function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hilbert's Tenth Problem is Unsolvable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4115143 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decision problem for exponential diophantine equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3962995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of negative answer to Hilbert's $10$th problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3964549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Register machine proof of the theorem on exponential diophantine representation of enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of Recursive Unsolvability of Hilbert's Tenth Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diophantine induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Program an Infinite Abacus / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-complete decision problems for binary quadratics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4160889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the theorem on exponential diophantine representation of enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On investigations on some algorithmic problems in algebra and number theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction of an arbitrary diophantine equation to one in 13 unknowns / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Informal Arithmetical Approach to Computability and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An unsolvable problem in number theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existential Definability in Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on Binomial Coefficients I-A Generalization of Lucas' Congruence† / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the number of zeros of polynomials and exponential polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical number theory I. An introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3893912 / rank
 
Normal rank

Latest revision as of 15:25, 22 May 2024

scientific article
Language Label Description Also known as
English
A direct method for simulating partial recursive functions by Diophantine equations
scientific article

    Statements

    A direct method for simulating partial recursive functions by Diophantine equations (English)
    0 references
    1 September 1994
    0 references
    exponential Diophantine representation of recursively enumerable predicates
    0 references
    partial recursive function
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers