• 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.

• Korean Journal of Logic
• /
• v.5 no.2
• /
• pp.67-91
• /
• 2002

모순에 대한 비트겐슈타인의 견해는 매우 특이할 뿐만 아니라 여러 논란을 불러일으키기에 충분하다. 예컨대 그에 따르면 모순이 수학체계에 존재한다 해도 해로울 것이 전혀 없다. 튜링은 이러한 비트겐슈타인의 견해에 대해서, 만일 수학체계에 모순이 있다면, "그 적용의 경우에 다리가 붕괴될 수도 있다"고 공격한다. 반면에 비트겐슈타인은 "모순 때문에 다리가 붕괴될 수도 있다고 말하는 것은 아주 옳은 소리로 들리지 않는다"라고 응수한다. 과연 유모순적인 계산체계로 건설된 다리는 무너질 것인가? 이 물음을 "튜링의 물음"이라고 부르고, 유모순적인 계산체계로 건설된 다리를 간단히 "튜링의 다리"라고 부르기로 하자. 이 글에서는 바로 이 튜링의 물음에 직접 대답하기 위해서 4개의 입론이 제시되고 있다. 우리는 이러한 입론을 토대로 해서 튜링의 물음에 대해 대답할 수 있고, 비트겐슈타인과 튜링의 논쟁을 조명할 수 있으며, 비트겐슈타인의 수학철학의 핵심적인 측면을 살펴볼 수 있다.

• Journal for History of Mathematics
• /
• v.17 no.4
• /
• pp.27-36
• /
• 2004

This paper addresses G$\ddot{o}$del's critique of Turing's mechanism that a configuration of the Turing machine corresponds to each state of human mind. The first part gives a quick overview of Turing's analysis of cognition as computation and its variants. In the following part, we describe the concept of Turing machines, and the third part explains the computational limitations of Turing machines as a cognitive system. The fourth part demonstrates that Godel did not agree with Turing's argument, sometimes referred to as mechanism. Finally, we discuss an oracle Turing machine and its implications.

• Journal for History of Mathematics
• /
• v.25 no.3
• /
• pp.15-27
• /
• 2012

This paper aims to examine Alan Turing's life at the centenary of his birth and to discuss a philosophical implication of his work by concentrating on halting theorem particularly. Turing negatively solved Hilbert's decision problem by proving impossibility of solving halting problem. In this paper I claim that the impossibility implies limits of reason, and accordingly that the marginality in cognition and/or in action should be recognized.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10a
• /
• pp.185-186
• /
• 2007

ITSP(Internet Telephony Service Provider)를 이용한 VoIP 서비스의 사용자가 증가함에 따라 VoIP 스팸은 큰 문제로 대두되고 있다. 기존의 일반 전화 때부터 사용되던 스팸은 실시간적 음성 통신이라는 특성상 콘텐츠 필터링을 하기 어렵기 때문에 롤 행위 패턴 조사를 통해 스패머(Spammer)를 구분하고 있다. 그러나 잘못된 오판으로 인한 문제와 스팸으로 인식하는 임계값을 넘지 않는 한도의 스팸 전송, 그리고 여러 사용자가 하나의 번호를 공유하여 사용하는 경우에는 여전히 스팸의 위협이 남아 있다. 이에 본 논문에서는 튜링 테스트를 이용한 VoIP 스팸 방지를 제안한다. 제안된 방법은 송신자에게 튜링 테스트를 거치게 하고, 튜링 테스트를 통과한 사용자만 수신자와 연결이 되는 방식으로 동작한다. 또한 튜링 테스트를 통과한 정상적인 사용자에게는 티켓을 줌으로써 재발신시 거쳐야하는 튜링 테스트의 번거로움을 줄일 수 있다. 제안된 방법은 ASUS WL-500G 무선 공유기 및 Asterisk IP-PBX에서 구현되었고 실험을 통해 제안된 방법의 유효성을 검증하였다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.261-265
• /
• 2008

As increasing the user of VoIP service using ITSP(Internet Telephony Service Provider), the VoIP spam becomes a big problem. The spam used in the existing public telephone is detected by using the pattern inspection of call behavior because it is difficult to filter contents for the characteristic of real-time voice communication. However there is a false-positive problem. The threat on spam remains where spam with low threshold can't be detected or users share one number. In this paper, we propose anti-spam for VoIP based on luring test. The proposed method gives a user luring test and he/she can connect to a receiver if passing turing test. A ticket is given to a user that pass luring test and it reduces overhead of luring test in re-dial. The proposed method is implemented on ASUS WL-500G wireless router and Asterisk IP-PBX. Experimental results show the effectiveness of the proposed method.

• Journal of Science and Technology Studies
• /
• v.17 no.1
• /
• pp.5-39
• /
• 2017

In March 2016, the computer Go program, AlphaGo, defeated Sedol Lee, a Korean professional Go player of 9-dan rank. This victory by AlphaGo shows the rise in popularity of artificial intelligence (AI). Not only was this game a testament to machine performance, it was the type of game that extended the Turing test. When the interrogator cannot differentiate between human being and machine, the machine has passed the test. This article examines the interactions between AI and human beings and studies the social nature of intelligence through the AlphaGo case. Collins insists that knowledge or intelligence is social and embodied, and the interrogators in the Turing test can identify the difference between native members and non-members through their knowledge only. Applying this concept, AlphaGo, as subject A of this test, fulfilled its role of stirring up the classical "truth of human." Meanwhile, Lee as subject B, played to speak the truth by revealing his own qualities. Here, it is also important role that interrogators judge what it is. Many spectators, as interrogators, have intervened to confirm the border between human beings and machines by using their embodied and social knowledge.

• Journal of The Korean Association of Information Education
• /
• v.20 no.4
• /
• pp.375-386
• /
• 2016

Research of information gifted analysis through the adult gifted electrical of information field is not nearly done. Therefore, there is a need for a study to analyze the information gifted property through the life of adult talent. In the present study, the 'Alan Turing' who left the achievements in the field of information was chosen to study. And analyzed the biographies of Alan Turing in the content analysis method was used to derive the factor of information gifted property. As a result, it was found that it contain twelve factors to information gifted of the two regions of Alan Turing. The information special education for extending the gifted of information that is exposed in various forms, there is a need to provide a curriculum that can extend the capabilities of mathematics and science education methods, long-term and multilateral it is necessary to determine the tools and good sense of the information talent teacher that can be to determine the information gifted. Based on this understanding, in future studies, to determine the elementary school information gifted, various information gifted either present were present as may be a substantial aid targeting a map information gifted of the factor analysis, there is a need to be sustained process of information gifted expression of adult information gifted in the direction of a more systematic analysis.

• KSCI Review
• /
• v.24 no.2
• /
• pp.7-12
• /
• 2016

• Electronics and Telecommunications Trends
• /
• v.32 no.1
• /
• pp.72-81
• /
• 2017

2008년, Satoshi Nakamoto라는 가명을 쓰는 신원미상의 사람(들) 혹은 단체가 비트코인을 소개하였다. 그 이후, 현재 비트코인의 총액은 10억달러 이상에 달한다. 비트코인을 지탱하는 기술인 블록체인에 의해 이론적으로 비트코인은 거의 조작이 불가능하며 거의 영구적으로 기록에 남게 된다. 이 획기적인 기술로 인해 비트코인 이 후 약 700개가 넘는 암호화폐가 생겨났으며, 암호화폐뿐만이 아닌 금융권/비금융권, 정부기관 등 많은 도메인에서 블록체인 기술이 도입되어 가고 있다. 비트코인 이후 가장 대표적인 블록체인 기반의 프로젝트로는 튜링 완전한 컴퓨팅 기능이 있는 이더리움이 있다. 이 튜링 완전한 컴퓨팅 기능으로 인해 이더리움 상에서 투명하게 데이터 저장 및 프로그램 실행을 할 수 있다. 이로 인해 이더리움을 이용한 많은 혁신적인 이용 사례가 생겨났다. 본고에서는 비트코인 후 블록체인의 기술을 이더리움 중심으로 소개하며 해결해야 할 기술적 이슈들과 동향에 관해 분석한다. 그리고 현재 이더리움 외에 개발되어오는 블록체인에 대해 간략히 살펴본다.