Register machine proof of the theorem on exponential diophantine representation of enumerable sets (Q3734384): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The decision problem for exponential diophantine equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hilbert's Tenth Problem is Unsolvable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetical problems and recursively enumerable predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Undecidability--An Exposition / 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: Applications of a Simple Counting Technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / 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: An Informal Arithmetical Approach to Computability and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Program an Infinite Abacus / rank
 
Normal rank

Latest revision as of 14:29, 17 June 2024

scientific article
Language Label Description Also known as
English
Register machine proof of the theorem on exponential diophantine representation of enumerable sets
scientific article

    Statements

    Identifiers