On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines (Q4729768): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q60781615, #quickstatements; #temporary_batch_1706364719135 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:28, 7 February 2024
scientific article; zbMATH DE number 4114604
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines |
scientific article; zbMATH DE number 4114604 |
Statements
On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines (English)
0 references
1989
0 references
computation theory
0 references
computation over an ordered ring
0 references
computation over the reals
0 references
universal machine
0 references
recursive function
0 references
NP-completeness
0 references
complements of Julia sets
0 references
undecidable sets
0 references
4-feasibility problem
0 references
