Real number models under various sets of operations
- The computational model of Blum, Shub, and Smale (1989, Bull. Amer. Math. Soc.21, 1-46) yields a numerous number of different algorithm-classes if the allowed set of instructions is varied. For two such classes we consider the "P = NP?" problem as well as the question of whether the NP- problems are decidable.
Author: | Klaus MeerGND |
---|---|
URL: | http://www.sciencedirect.com/science/article/pii/S0885064X8371023X |
DOI: | https://doi.org/10.1006/jcom.1993.1023 |
ISSN: | 0885-064X |
Title of the source (English): | Journal of Complexity |
Document Type: | Scientific journal article peer-reviewed |
Language: | English |
Year of publication: | 1993 |
Volume/Year: | 9 |
Issue number: | 3 |
First Page: | 366 |
Last Page: | 372 |
Faculty/Chair: | Fakultät 1 MINT - Mathematik, Informatik, Physik, Elektro- und Informationstechnik / FG Theoretische Informatik |