[2017학년도 제2학기 서울대학교 교육상 수상자 특별강연] 튜링의 1935년: 컴퓨터 원조논문이 나오기까지의 1년여 과정에 대한 추측

일시: 
2017년 12월 7일 목요일 AM 11:00 - 2017년 12월 7일 목요일 PM 1:00
장소: 
302동 308호

호스트: 전화숙 컴퓨터공학부장 (x1839, 880-1839)

요약

This talk is about my guess work on the thought process of Turing while he was inventing the Universal Machine, the blueprint of computers. The Universal Machine first appeared in Turing's seminal paper "On Computable Numbers, With an Application to the Entscheitungsproblem" that was submitted in May 1936. It is known that the paper was motivated by a course "Foundations of Mathematics and Godel's Theorem" taught by Max Newmann that Turing took in 1935. I trace back the days and the thought process that might have happened in Turing's mind while he tried to prove again the Godel's result in his own style, which was consummate in his 1936 paper. My investigation is a collection of my guess about what Max Newmann might have taught in the class and about how Turing could be inspired by the course. This talk will contain an intuitive review of Godel's Incompleteness proof and Turing's 1936 paper. This talk can be considered a kind of faction (fact + fiction).

연사 소개

  • 2003 - 현재: 서울대 컴퓨터공학부 부교수/교수

  • 2008 – 2015: 센터장, 소프트웨어무결점 연구센터 (교과부/한국연구재단 선도연구센터 ERC)

  • 1998 - 2003: 단장, 프로그램분석시스템 연구단 (과기부/과학재단 창의연구단 CRI)

  • 1993 - 1995: 정규연구원, SW Principles Research Dept, Bell Labs

  • 1993 PhD Computer Science, Univ of Illinois at Urbana-Champaign

  • 방문교수: Stanford(2017), MIT(2012, 2008), CMU(2008), ENS Paris(파리고등사범학교 2016, 2002)