Characteristic Properties of Majorant-Computability over the Reals
暂无分享,去创建一个
[1] I︠U︡riĭ Leonidovich Ershov. Definability and Computability , 1996 .
[2] Ker-I Ko,et al. Computational Complexity of Real Functions , 1982, Theor. Comput. Sci..
[3] J. Shepherdson. Computational Complexity of Real Functions , 1985 .
[4] M-F Roy,et al. Géométrie algébrique réelle , 1987 .
[5] N. Jacobson,et al. Basic Algebra I , 1976 .
[6] S. Smale,et al. On a theory of computation and complexity over the real numbers; np-completeness , 1989 .
[7] J. V. Tucker,et al. Effective algebras , 1995, Logic in Computer Science.
[8] Richard Montague. Recursion Theory as a Branch of Model Theory1 , 1968 .
[9] Marian Boykan Pour-El,et al. Computability in analysis and physics , 1989, Perspectives in Mathematical Logic.
[10] Dana S. Scott,et al. Outline of a Mathematical Theory of Computation , 1970 .
[11] A. Grzegorczyk. On the definitions of computable real continuous functions , 1957 .
[12] Yiannis N. Moschovakis,et al. Abstract first order computability. II , 1969 .
[13] Abbas Edalat,et al. A Domain-Theoretic Approach to Computability on the Real Line , 1999, Theor. Comput. Sci..
[14] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[15] Samson Abramsky,et al. Handbook of logic in computer science. , 1992 .
[16] B. Dahn. Admissible sets and structures , 1978 .