The Interactive Nature of Computing: Refuting the Strong Church–Turing Thesis
暂无分享,去创建一个
[1] C. Teuscher,et al. Alan Turing: Life and Legacy of a Great Thinker , 2004, Springer Berlin Heidelberg.
[2] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .
[3] Peter Wegner. Towards Empirical Computer Science , 1999 .
[4] WegnerPeter,et al. The Interactive Nature of Computing , 2008 .
[5] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[6] Peter Wegner,et al. Turing’s Ideas and Models of Computation , 2004 .
[7] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.
[8] Peter Wegner,et al. Interactive , 2021, Encyclopedia of the UN Sustainable Development Goals.
[9] A. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .
[10] Peter J. Denning. The field of programmers myth , 2004, CACM.
[11] Christos H. Papadimitriou. Database metatheory: asking the big queries , 1995 .
[12] Peter Wegner,et al. The Church-Turing Thesis: Breaking the Myth , 2005, CiE.
[13] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[14] Edsger W. Dijkstra,et al. Go to Statement Considered Harmful (Reprint) , 2002, Software Pioneers.
[15] William F. Atchison,et al. An undergraduate program in computer science—preliminary recommendations , 1965, CACM.
[16] Michael J. Fischer,et al. Fast On-Line Integer Multiplication , 1974, J. Comput. Syst. Sci..
[17] Carol E. Cleland. The Church–Turing Thesis. A Last Vestige of a Failed Mathematical Program , 2006 .
[18] Michael Sipser,et al. Introduction to the Theory of Computation , 1996, SIGA.
[19] Peter Wegner,et al. Why interaction is more powerful than algorithms , 1997, CACM.
[20] B. Jack Copeland,et al. The Church-Turing Thesis , 2007 .
[21] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[22] Scott A. Smolka,et al. Turing machines, transition systems, and interaction , 2004, Inf. Comput..
[23] Edsger W. Dijkstra,et al. Letters to the editor: go to statement considered harmful , 1968, CACM.
[24] Jan van Leeuwen,et al. The Turing machine paradigm in contemporary computing , 2001 .
[25] Hartmut Fitz,et al. Church's thesis and physical computation , 2006 .
[26] Rodney A. Brooks,et al. Intelligence Without Reason , 1991, IJCAI.
[27] Edsger W. Dijkstra,et al. Go To Statement Considered Harmful , 2022, Software Pioneers.
[28] Peter Wegner,et al. Computation beyond turing machines , 2003, CACM.
[29] Edward J. McCluskey,et al. Curriculum 68: Recommendations for academic programs in computer science: a report of the ACM curriculum committee on computer science , 1968, CACM.
[30] Allan Borodin,et al. Introduction to Computer Science. Problems, Algorithms, Languages, Information and Computers. , 1970 .
[31] Michael J. Fischer,et al. Fast on-line integer multiplication , 1973, STOC '73.
[32] B. Engquist,et al. Mathematics Unlimited: 2001 and Beyond , 2001 .
[33] Donald E. Knuth. The art of computer programming: fundamental algorithms , 1969 .
[34] Carol E. Cleland. The concept of computability , 2004, Theor. Comput. Sci..
[35] Nancy A. Lynch,et al. An introduction to input/output automata , 1989 .
[36] Wilfried Sieg. Computability and Discrete Dynamical Systems , 2005, CiE.
[37] Jan Wolenski,et al. Church's Thesis After 70 Years , 2007 .
[38] Donald E. Knuth,et al. The art of computer programming: V.1.: Fundamental algorithms , 1997 .
[39] P. Wegner. Programming Languages, Information Structures, and Machine Organization. , 1968 .
[40] Peter Kugel,et al. Computing Machines Can't Be Intelligent (...and Turing Said So) , 2002, Minds and Machines.