Simulation of simultaneous safe recursion over an arbitrary structure (Q845681): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A new recursion-theoretic characterization of the polytime functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4417859 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time / rank | |||
Normal rank | |||
Latest revision as of 10:53, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simulation of simultaneous safe recursion over an arbitrary structure |
scientific article |
Statements
Simulation of simultaneous safe recursion over an arbitrary structure (English)
0 references
29 January 2010
0 references
safe recursion
0 references
BSS-machines
0 references
projective Turing machines
0 references
theory of computation
0 references
computational complexity
0 references
