Curso

 

Lógica y modelos de inteligencia mecánica:

Supuestos metodológicos y representacionales en el modelo clásico

 

Dr. Raymundo Morado

 

División de Estudios de Posgrado de la Facultad de Filosofía y Letras de la UNAM

Área de Lógica, Filosofía del Lenguaje y Filosofía de la Mente

 

Primavera de 2005 (Semestre 2005-2).

Las sesiones serán en el aula 3 del IIF-UNAM, miércoles de 16:00 a 18:00 horas.

Metodología:  

Habrá un análisis conjunto de lecturas previamente fijadas, discusión y estudio independiente que pueda derivar en exposiciones en clase de temas previamente acordados con el maestro.

Forma de valuación:

Cada miembro del grupo hace varias presentaciones, y habrá un trabajo de investigación final.

Bibliografía

 

 

Akman, Varol, Patrick Blackburn. "Editorial: Alan Turing and Artificial Intelligence." Journal of Logic, Language, and Information 2000. 9, pp. 391-395.

Beeson, Michael J. "Computerizing Mathematics: Logic and Computation." In Herken (1994), pp. 173-205.

Börger, E., Grädel, E., Gurevich, Y., The Classical Decision Problem, Springer, Universitext, 2001.

Bringsjord, Selmer, Clarke Caporale, Ron Noel. "Animals, zombanimals, and the total Turing test: The essence of artificial intelligence." Journal of Logic, Language, and Information 2000. 9, pp. 397-418, with extra pictures available at http://www.rpi.edu/~faheyj2/SB/SELPAP/ZOMBANIMALS/zombanimals2.pdf.

Churchland, P.M., “Learning and Conceptual Change: The View from the Neurons”, in [5].

Clark, A., Millican, P.J.R., Machines and Thought, Clarendon Press, 1996.

Davies, Martin. "Influences of Mathematical Logic on Computer Science." In Herken (1994), pp. 289-299.

Davis, M., “The Myth of Hypercomputation”, Turing Festschrift (to appear).

Deutsch, D. "Quantum Theory, The Church-Turing principle and the universal quantum computer." Proc. R. Soc. Lond. 1985, A 400, pp. 97-117.

Edmonds, Bruce. "The constructability of artificial intelligence (as defined by the Turing test)." Journal of Logic, Language, and Information 2000. 9, pp. 419-424.

Griffor, E.R., Handbook of Computability Theory, Elsevier, 1999.

Harnad, S. "Minds, Machines and Turing." Journal of Logic, Language, and Information 2000. 9, pp. 425-445.

Hernández-Orallo, José. "Beyond the Turing Test."  Journal of Logic, Language, and Information 2000. 9, pp. 447-466.

Hilbert, D., Ackermann, W., Principles of Mathematical Logic, Chelsea Publishing Company, 1950.

Hodges, Andrew. "Alan Turing and theTuring Machine." In Herken (1994), pp. 3-14.

Kleene, Stephen C. "Recursive Predicates and Quantifiers." Transactions of the American Mathematical Society, 1943, vol. 53, no. 1, pp. 41-73.

Rapaport, William J. "How to Pass a Turing Test: Syntactic Semantics, Natural-Language Understanding, and First-Person Cognition." Journal of Logic, Language, and Information 2000. 9, pp. 467-490.

Schnelle, Helmut. "Turing Naturalized: Von Neumann´s Unfinished Project." In Herken (1994), pp.499-517.

Siegelmann, H.T., “Computation beyond the Turing Limit”, Science, vol. 268, pp. 545-548, 1995.

Siegelmann, H.T., Neural Networks and Analog Computation: Beyond the Turing Limit,  Birkhäuser, Progress in Theoretical Computer Science, 1999.

Sloman, Aaron. "The Irrelevance of Turing Machines to AI." In Matthias Scheutz (ed.), Computationalism: New Directions. Cambridge, MA: MIT Press, pp. 87-127. Available at http://www.cs.bham.ac.uk/research/cogaff/sloman.turing.irrelevant.pdf.

Soare, R.I., “The History and Concept of Computability”, in [5].

Trakhtenbrot, Boris A. "Comparing the Church and Turing Approaches: Two Prophetical Messages." In Herken (1994), pp.557-582.

Turing, A.M., “Computing Machinery and Intelligence”, Mind, 59, pp. 433-460, 1950.

Turing, A.M., “On Computable Numbers, with an Application to the Entscheidungsproblem”, Proceedings of the London Mathematical Society, series 2, vol. 42, pp. 230-265, 1936-7.