Effective Versions of Local Connectivity Properties
暂无分享,去创建一个
[1] Solomon Feferman,et al. Turing’s Thesis , 2021, Alan Turing's Systems of Logic.
[2] Stefan Friedrich,et al. Topology , 2019, Arch. Formal Proofs.
[3] Anil Nerode,et al. Handbook of Recursive Mathematics , 1998 .
[4] Klaus Weihrauch,et al. Computability on Subsets of Euclidean Space I: Closed and Compact Subsets , 1999, Theor. Comput. Sci..
[5] R. O. Gandy,et al. COMPUTABILITY IN ANALYSIS AND PHYSICS (Perspectives in Mathematical Logic) , 1991 .
[6] Marian Boykan Pour-El,et al. Computability in analysis and physics , 1989, Perspectives in Mathematical Logic.
[7] Martin D. Davis,et al. Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.
[8] Lawrence Welch,et al. Recursive and Nonextendible Functions over the Reals; Filter Foundation for Recursive Analysis, II , 1999, Ann. Pure Appl. Log..
[9] Jack H. Lutz,et al. Curves that must be retraced , 2008, Inf. Comput..
[10] Joseph S. Miller. Effectiveness for Embedded Spheres and Balls , 2002, Electron. Notes Theor. Comput. Sci..
[11] Klaus Weihrauch,et al. Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.
[12] Vasco Brattka. Plottable Real Number Functions and the Computable Graph Theorem , 2008, SIAM J. Comput..
[13] Stefan Mazurkiewicz,et al. Sur les lignes de Jordan , 1920 .
[14] James R. Munkres,et al. Topology; a first course , 1974 .
[15] R. Stephenson. A and V , 1962, The British journal of ophthalmology.
[16] Martin Ziegler. Computability on Regular Subsets of Euclidean Space , 2002 .
[17] B. Jack Copeland. Turing’s Thesis , 2006 .
[18] I︠U︡riĭ Leonidovich Ershov. Recursive algebra, analysis and combinatorics , 1998 .
[19] Lawrence Welch,et al. Point-Free Topological Spaces, Functions and Recursive Points: Filter Foundation for Recursive Analysis I , 1998, Ann. Pure Appl. Log..