论文信息 - Computational Complexity of Real Functions - 字舞流文

Computational Complexity of Real Functions

[1] Ker-I Ko,et al. Computational Complexity of Real Functions , 1982, Theor. Comput. Sci..

[2] Ker-I Ko. The Maximum Value Problem and NP Real Numbers , 1982, J. Comput. Syst. Sci..

[3] S. Smale. The fundamental theorem of algebra and complexity theory , 1981 .

[4] John C. Shepherdson,et al. On the Definition of Computable Function of a Real Variable , 1976, Math. Log. Q..

[5] Marian Boykan Pour-El,et al. On a simple definition of computable function of a real variable-with applications to functions of a complex variable , 1975, Math. Log. Q..

[6] M. B. Pour-El,et al. Abstract computability and its relation to the general purpose analog computer (some connections between logic, differential equations and analog computers) , 1974 .

[7] Gabor T. Herman,et al. Computability over arbitrary fields , 1969, STOC '69.

[8] A. Nerode,et al. Review: Daniel Lacombe, Les Ensembles Recursivement Ouverts ou Fermes, et Leurs Applications a L'Analyse Recursive , 1959 .

[9] D. Klaua. Die Präzisierung des Berechenbarkeitsbegriffes in der Analysis mit Hilfe Rationaler Funktionale , 1959 .

[10] A. Grzegorczyk. On the definitions of computable real continuous functions , 1957 .