Computability and Complexity in Analysis
暂无分享,去创建一个
[1] Anil Nerode,et al. Models for Hybrid Systems: Automata, Topologies, Controllability, Observability , 1992, Hybrid Systems.
[2] Abbas Edalat. Domain Theory and Integration , 1995, Theor. Comput. Sci..
[3] A. Jung,et al. Cartesian closed categories of domains , 1989 .
[4] Klaus Keimel,et al. The way-below relation of function spaces over semantic domains , 1998 .
[5] Dana S. Scott,et al. Outline of a Mathematical Theory of Computation , 1970 .
[6] Oleg V. Kudinov,et al. Characteristic Properties of Majorant-Computability over the Reals , 1998, CSL.
[7] Thomas A. Henzinger,et al. Towards Refining Temporal Specifications into Hybrid Systems , 1992, Hybrid Systems.
[8] Yu. L. Ershov. Computable functionals of finite types , 1972 .
[9] Oleg V. Kudinov,et al. A Logical Approach to Specification of Hybrid Systems , 1999, Ershov Memorial Conference.
[10] R. Soare. Recursive theory and Dedekind cuts , 1969 .
[11] Thomas A. Henzinger,et al. Reachability Verification for Hybrid Automata , 1998, HSCC.
[12] I︠U︡riĭ Leonidovich Ershov. Definability and Computability , 1996 .
[13] J. V. Tucker,et al. Complete local rings as domains , 1988, Journal of Symbolic Logic (JSL).
[14] Jens Blanck,et al. Domain Representability of Metric Spaces , 1997, Ann. Pure Appl. Log..
[15] Hing Tong,et al. Some characterizations of normal and perfectly normal spaces , 1952 .
[16] Pietro Di Gianantonio. Real Number Computability and Domain Theory , 1996, Inf. Comput..
[17] Richard Montague. Recursion Theory as a Branch of Model Theory1 , 1968 .
[18] Jon Barwise,et al. Admissible sets and structures , 1975 .
[19] J. V. Tucker,et al. Effective algebras , 1995, Logic in Computer Science.
[20] H. G. Rice,et al. Recursive real numbers , 1954 .
[21] Yiannis N. Moschovakis,et al. Abstract first order computability. II , 1969 .
[22] Martín Hötzel Escardó,et al. Function-space compactifications of function spaces , 2002 .
[23] S. Smale,et al. On a theory of computation and complexity over the real numbers; np-completeness , 1989 .
[24] Chun-Kuen Ho,et al. Relatively Recursive Reals and Real Functions , 1994, Theor. Comput. Sci..
[25] K. Hofmann,et al. A Compendium of Continuous Lattices , 1980 .
[26] A. Grzegorczyk. On the definitions of computable real continuous functions , 1957 .