TY - GEN A1 - Meer, Klaus T1 - Real number models under various sets of operations T2 - Journal of Complexity N2 - 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. Y1 - 2016 UR - https://opus4.kobv.de/opus4-UBICO/frontdoor/index/index/docId/15884 UR - http://www.sciencedirect.com/science/article/pii/S0885064X8371023X SN - 0885-064X VL - 9 IS - 3 SP - 366 EP - 372 ER -