On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines (Q4729768): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1090/s0273-0979-1989-15750-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2071846104 / rank | |||
Normal rank | |||
Latest revision as of 10:38, 30 July 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
0 references
