Bibliography

1

Ashcraft, M.H. (1994) Human Memory and Cognition (New York, NY: HarperCollins).

2

Bringsjord, S. & Zenzen, M. (forthcoming-a) ``Cognition is Not Computation: The Argument From Irreversibility," Synthese.

3

Bringsjord, S. & Ferrucci, D. (forthcoming-b) Artificial Intelligence and Literary Creativity: The State of the Art (Hillsdale, NJ: Lawrence Erlbaum).

4

Bringsjord, S. (forthcoming-c) ``Philosophy and `Super'-Computation," in Moor, J., and Bynum, T., eds., The Digital Phoenix, Basil Blackwell.

5

Bringsjord, S. (1992) What Robots Can and Can't Be (Dordrecht, The Netherlands: Kluwer Academic Publishers).

6

Boolos, G.S. & Jeffrey, R.C. (1989) Computability and Logic 3rd edition (Cambridge, UK: Cambridge University Press).

7

Charniak, E. & McDermott, D. (1985) Introduction to Artificial Intelligence (Reading, MA: Addison-Wesley).

8

Church, A. (1936) ``An Unsolvable Problem of Elementary Number theory," in Dave, M., ed., The Undecidable (New York, NY: Raven Press), 89-100.

9

Cleland, C. (1995) ``Effective Procedures and Computable Functions," Minds and Machines 5: 9-23.

10

Cleland, C. (1993) ``Is the Church-Thesis True?" Minds and Machines 3: 283-312.

11

Davis, M. & Weyuker,E. (1994) Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science 2nd Edition (New York, NY: Academic Press).)

12

Dennett, D.C. (1991) Consciousness Explained (Boston, MA: Little, Brown).

13

Eco, U. (1979) The Role of the Reader: Explorations in the Semiotics of Texts (Bloomington, IN: Indiana University Press).

14

Ebbinghaus, H.D., Flum, J., Thomas, W. (1984) Mathematical Logic (New York, NY: Springer-Verlag).

15

Folina, J. (1993) ``Commentary on Selmer Bringsjord's `Church's Thesis, Contra Mendelson, Is Unprovable $\ldots$ And Worse: it May be False'," Annual Eastern Division APA Meeting, Atlanta, GA, December 27, 1993.

16

Grzegorczyk, A. (1957) ``On the Definitions of Computable Real Continuous Functions," Fundamentals of Mathematics 44: 61-71.

17

Grzegorczyk, A. (1955) ``Computable Functionals," Fundamentals of Mathematics 42: 168-202.

18

Hofstadter, D. (1982) ``Metafont, Metamathematics, and Metaphysics," Visible Language 14.4: 309-338.

19

Kalmár, L. (1959) ``An Argument Against the Plausibility of Church's Thesis," in Heyting, A., ed., Constructivity in Mathematics (Amsterdam, Holland: North-Holland), 72-80.

20

Kleene, S.C. (1936) ``General Recursive Functions of Natural Numbers," Math. Annalen 112: 727-742.

21

Kreisel, G. (1968) ``Church's Thesis: A Kind of Reducibility Thesis for Constructive Mathematics," in Intuitionism and Proof Theory: Proceedings of a Summer Conference at Buffalo, N.Y., eds., Kino, A., Myhill, J., and Vesley, R.E. (Amsterdam, Holland: North-Holland).

22

Kreisel, G. (1965) ``Mathematical Logic," Lectures in Modern Mathematics, ed., Saaty, T.L. (New York, NY: John Wiley).

23

Kugel, P. (1986) ``Thinking May Be More Than Computing," Cognition 22: 137-198.

24

(1981) Graphic Art Materials Reference Manual (New York, NY: Letraset).

25

McMenamin, M. ``Deciding Uncountable Sets and Church's Thesis," unpublished manuscript.

26

Meehan, J. (1981) ``TALE-SPIN," in Schank, R. & Reisbeck, C., eds., Inside Computer Understanding: Five Programs Plus Miniatures (Hillsdale, NJ: Lawrence Erlbaum Associates), 197-226.

27

Mendelson, E. (1990) ``Second Thoughts About Church's Thesis and Mathematical Proofs," Journal of Philosophy 87.5: 225-233.

28

Mendelson, E. (1963) ``On Some Recent Criticism of Church's Thesis," Notre Dame Journal of Formal Logic 4.3: 201-205.

29

Moschovakis, Y. (1968) ``Review of Four Recent Papers in Church's Thesis," Journal of Symbolic Logic 33: 471-472. (One of the four papers is: Kalmár, L. (1959) ``An Argument Against the Plausibility of Church's Thesis," in Heyting, A., ed., Constructivity in Mathematics (Amsterdam, Holland: North-Holland), 72-80.

30

Nelson, R.J. (1987) ``Church's Thesis and Cognitive Science," Notre Dame Journal of Formal Logic 28.4: 581-614.

31

Pollock, J. (1995) Cognitive Carpentry: A Blueprint for How to Build a Person (Cambridge, MA: MIT Press).

32

Post, E.L. (1936) ``Finite Combinatory Processes - Formulation 1," Journal of Symbolic Logic 1.3: 103-105.

33

Schank, R. (1995) Tell Me a Story (Evanston, IL: Northwestern University Press).

34

Siegelmann, H. (1995) ``Computation Beyond the Turing Limit," Science 268: 545-548.

35

Siegelmann, H. and Sontag, E.D. (1994) ``Analog Computation Via Neural Nets," Theoretical Computer Science 131: 331-360.

36

Stillings, N.A., Weisler, S.E., Chase, C.H., Feinstein, M.H., Garfield, J.L. & Rissland, E.L. (1995) Cognitive Science (Cambridge, MA: MIT Press).

37

Thomas, W. (1973) ``Doubts About Some Standard Arguments for Church's Thesis," in Papers of the Fourth International Congress for Logic, Methodology, and Philosophy of Science, Bucharest (Holland: D. Reidel).

38

Trabasso, T. (1996) ``Review of Knowledge and Memory: The Real Story," Robert S. Wyer, ed., Lawrence Erlbaum, 1995, Minds & Machines 6: 399-403.

39

Wyer, R.S. (1995) Knowledge and Memory: The Real Story (Hillsdale, NJ: Lawrence Erlbaum Associates).