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

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

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

• Korean Journal of Cognitive Science
• /
• v.6 no.3
• /
• pp.5-23
• /
• 1995

According to a well-known argument (so-called the Godelian argument) proposed by Lucas. Godel's theorem refutes the thesis of mechanism. that is, the thesis that human cognitive system is no more than a Turing machine. The main aim of this paper is to show that this argument is not successful. However. I also argue that many pre-existing objections (by Benacerraf, Slezak. Boyer. Hofstadter etc.) to Gooelian argument are not satisfactory. either. Using Tarski's theorem. I then strengthen what I caII the consistency objection to Godelian argument. In my dilemma objection obtained. Godelian argument doesn't work because the argument has a false premise if we have the concept of global truth and the argument cannot be stated if not.

• Proceedings of the KSME Conference
• /
• 2004.11a
• /
• pp.956-961
• /
• 2004

This paper proposes a study on the spherical lens manufacturing by simultaneous 3 axis for NC lathe. We use friction drive system for moving system in experimental diamond turing machine. The diamond turning machine use manufacturing for high quality lens, mirror and many optics products. Especially, the high tech industry require a lot of lens. For example, optical engineering. medical science, space engineering and material engineering etc. The friction drive system is very simple and quiet, compared to ball screw system. We find a problem at the simultaneous 3 axis and suggest a solution. Also, when we manufactured a micro lens. find a problem and solution.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.24 no.3
• /
• pp.321-330
• /
• 2020

Data classification and clustering is one of the most common applications of the machine learning. In this paper, we aim to provide the insight of the classification for Turing pattern image, which has high nonlinearity, with feature engineering using the machine learning without a multi-layered algorithm. For a given image data X whose fixel values are defined in [-1, 1], X - X³ and ∇X would be more meaningful feature than X to represent the interface and bulk region for a complex pattern image data. Therefore, we use X - X³ and ∇X in the neural network and clustering algorithm to classification. The results validate the feasibility of the proposed approach.

• Proceedings of the Korean Society for Cognitive Science Conference
• /
• 2000.05a
• /
• pp.322-328
• /
• 2000

This study discusses cognition as a computable mapping in cognitive system and relates G del's Incompleteness Theorems to the computability of cognition from a metamathematical perspective. Understanding cognition as a from of computation requires not only Turing machine models but also neural network models. In previous studies of computation by cognitive systems, it is remarkable to note how little serious attention has been given to the issue of computation by neural networks with respect to G del's Incompleteness Theorems. To address this problem, first, we introduce a definition of cognition and cognitive science. Second, we deal with G del's view of computability, incompleteness and speed-up theorems, and then we interpret G del's disjunction on the mind and the machine. Third, we discuss cognition as a Turing computable function and its relation to G del's incompleteness. Finally, we investigate cognition as a neural computable function and its relation to G del's incompleteness. The results show that a second-order representing system can be implemented by a finite recurrent neural network. Hence one cannot prove the consistency of such neural networks in terms of first-order theories. Neural computability, theoretically, is beyond the computational incompleteness of Turing machines. If cognition is a neural computable function, then G del's incompleteness result does not limit the compytational capability of cognition in humans or in artifacts.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.6 no.4
• /
• pp.101-107
• /
• 1997

In order to detect and suppress chatter in turning process, a stability control methodology was studied through manipulation of spindle speeds regarding to chatter frequencies, The chatter frequency was identified by monitoring and signal processing of sound pressure during turing on a lathe. The stability control methodology can select stable spindle speeds without knowing a prior knowledge of machine compliances and cutting dynamics. Reliability of the developed stability control methodology was verified through turing experiments on an engine lathe. Experimental results show that a microphone is an excellent sensor for chatter detection and control .

• Korean Journal of Cognitive Science
• /
• v.8 no.1
• /
• pp.37-56
• /
• 1997

Can the appropriately programmed computer think?I analyse,in this paper, argugments for and against strong AI-thesis,basically Turing's argument and Searle's chinese room argument.Through a cirtical review of these arguments, I try to show that the supportes of Al-thesis like Turing fail to explain the subjective nature of human consciousness.However,I do not think that subjective consciousness is a necessary condition for the ability to understand language.(In this respect my views are different from Searle's). But when we consider the conditions of humans as language users,we should presuppose that a human being is the unity of body and mind (or consciousness). Therefore, our subjective consciousness,together with human body(thus,way of our behavior and life). serve as a mark of person.

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