SubIndex on COMPUTABILITY (BibTex)

• Blum,L; Cucker,F; Shub,M; Smale,S; 1996, Complexity and Real Computation: A Manifesto, International Journal of Bifurcation and Chaos, 6, 3-26
• Siegelmann,HT; 1995, Computation Beyond the turing Limit, Science, 268, 545-548
• Casti,JL; 1992, Reality Rules: II. picturing the world in Mathematics: The frontier, John-Wiley, New York
• Rosen,R; 1991, Life Itself - A Comprehensive Enquiry into the Nature, Origin and Fabrication of Life, Columbia University Press, New York
• Turney,P; 1990, Problems with Complexity in Gold's Paradigm of Induction-Part I: Dynamic Complexity, International Journal of General Systems, 17, 329-342
• Turney,P; 1990, Problems with Complexity in Gold's Paradigm of Induction--Part II: Static Complexity, International Journal of General Systems, 17, 343-358
• Machlin,R; 1990, The Complex Behaviour of Simple Machines, Physica D, 42, 85-98
• Chaitin,GJ; 1987, Algorithmic Information Theory, Cambridge University Press, Cambridge
• Shapiro,S; 1981, Understanding Church's Thesis, Journal of Philosophical Logic, 10, 353-365
• Bremermann,H; 1974, Algorithms, complexity, transcomputability and the analysis of systems, Proceedings of the Fifth Congress of the Deutsche Gesellschaft fur Kybernetik, Munich (eds) Reidel,W, Handler,W Spreng,M, Oldenbourg
• Lofgren,L; 1973, On the Formalization of Learning and Evolution, in Logic, Methodology and the Philosophy of Science IV, Eds.Suppes,P; Henkin,L; Joja,A; Moisil,GC; , North-Holland, Amsterdam, pages
• Feldman,JA; 1972, Some decidability results on grammatical inference and complexity, Information and Control, 20, 244-262