Wilfried Sieg @ IIMAS 01

Wilfried Sieg, de la Universidad
Carnegie Mellon, el viernes 11 de marzo a las 10:00 en el auditorio
del Instituto de Investigaciones en Matemáticas Aplicadas y Sistemas
(edificio de la biblioteca).

El Dr. Sieg es uno de los especialistas más destacados en temas de
computabilidad y filosofía e historia de la computación y las
matemáticas. En la siguiente liga se puede consultar su cv junto con
varias de sus publicaciones:

http://www.hss.cmu.edu/philosophy/faculty-sieg.php

Se anexa a continuación el resumen de la conferencia.

Church without Dogma: What is a computation, and why does it matter?

Notions of computations are used not only in computer science but
also, e.g., in cognitive psychology and philosophy of mind. The
notions originate, however, from logical work in the 1930s. The talk
is divided into three parts and ends with remarks about intelligent
machinery, automated proof search and local axiomatics.

The first part, Hilbert's Entscheidungsproblem, sketches the logical
context in which a precise notion of computability was needed.
Church's and Turing's theses assert dogmatically that the informal
notion of effective calculability is captured by rigorous concepts,
namely, general recursiveness and Turing machine computability.

The second part, Turing's Proof, describes Turing's important argument
showing that "what a computer can do" can be done by a Turing machine,
where computer is understood in a surprising way. The argument leads
to a methodological dilemma.

That dilemma is addressed in the third part, Axiomatic Analysis, by
formulating axioms for computability and a representation theorem:
models of the axioms are reducible to Turing machines. The analysis
can be extended to a general concept of parallel computation.

Category:

Education

Tags:

• Wilfried sieg
• IIMAS
• UNAM
• Church
• Turing
• Gödel
• Carnegie Mellon