• Korean Journal of Cognitive Science
• /
• v.23 no.3
• /
• pp.367-388
• /
• 2012

The centennial of Alan Mathison Turing(23 June 1912 - 7 June 1954) is an appropriate occasion on which to assess his profound influence on the development of cognitive science. His contributions to and attitudes toward that field are discussed from the metamathematical perspective. This essay addresses (i)Turing's mathematical analysis of cognition, (ii)universal Turing machines, (iii)the limitations of universal Turing machines, (iv)oracle Turing machine beyond universal Turing machine, and (v)Turing test for cognitive science. Turing was a ground-breaker, eager to move on to new fields. He actually opened wider the scientific windows to the mind. The results show that first, by means of mathematical logic Turing discovered a new bridge between the mind and the physical world. Second, Turing gave a new formal analysis of operations of the mind. Third, Turing investigated oracle Turing machines and connectionist network machines as new models of minds beyond the limitations of his own universal machines. This paper explores why the cognitive scientist would be ever expecting a new Turing Test on the shoulder of Alan Turing.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.496-500
• /
• 2001

When we cut a key way on the axial or on the boss, we generally use a slotter or a broach. To do the key seating, turing operations have to be preceded and then the key on the axial or on the boss can be seated. For this reason, the production process of key way cutting becomes complicated. If is necessary to simplify the process and we have developed a small practical machine for key way cutting. The machine is located on the carriage of the lathe. Using this small and practical key way machine, after operation the turing, you do not have to remove the workpiece from the chuck of the lathe to carry on the key seating process. The developed machine will save cutting time and the cost.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.1179-1185
• /
• 2003

시뮬레이션 상의 입력모델에 대한 기존의 연구는 과거의 자료를 바탕으로 선형의 모수적인 (parametric) 모형을 개발하는데 초점을 두고 있다. 그러나 이 경우에는 입력이 매우 복잡한 형태를 가지면 모수적인 모형을 잦는 것이 불가능해지므로 비모수적인(non-parametric) 접근방법이 절실한 실정이다 예로 인터넷 트래픽 모델의 시뮬레이션 수행시 입력으로 제공되는 단위 시간당 요구되는 웹 페이지의 수 같은 경우 데이터들 간데 종속관계가 매우 심하고 복잡하여 모수적 모형을 세우는데 어려움이 있다. 이러한 시스템들을 시뮬레이션 방법으로 분석 하고자 할 때, 기존의 trace-driven 시뮬레이션 방법이나 모수적 모형을 찾아 다수의 사실적인 시뮬레이션 입력 자료를 확보하는 것은 현실적으로 어려움이 있다. 따라서. 비모수적인 방법으로 다수의 사실적인 시뮬레이션 입력 자료를 생성하는 것이 필요하다. 이러한 비모수적인 방법에 대한 평가기준 설정은 시뮬레이션 상의 입력 모델에 대한 타당성을 제시한다는 점에서 또한 매우 중요하다. 본 논문에서는 붓트스트 랩의 방법중의 하나인 임계값 붓트스트랩을 이용하여 시뮬레이션 입력 자료 생성 방법을 개발하였고 Turing test를 통해 붓스트랩으로 생성산 입력 시나리오를 검증하였다.

• Korean Journal of Logic
• /
• v.8 no.2
• /
• pp.3-32
• /
• 2005

Hilbert's rational ambition to establish consistency in Number theory and mathematics in general was frustrated by the fact that the statement itself claiming consistency is undecidable within its formal system by $G\ddot{o}del's$ second theorem. Hilbert's optimism that a mathematician should not say "Ignorabimus" ("We don't know") in any mathematical problem also collapses, due to the presence of a undecidable statement that is neither provable nor refutable. The failure of his program receives more shock, because his system excludes any ambiguity and is based on only mechanical operations concerning signs and strings of signs. Above all, $G\ddot{o}del's$ theorem demonstrates the limits of formalization. Now, the notion of provability in the dimension of syntax comes to have priority over that of semantic truth in mathematics. In spite of his failure, the notion of algorithm(mechanical processe) made a direct contribution to the emergence of programming languages. Consequently, we believe that his program is failure, but a great one.