Thesis (Ph. D.)--Oregon State University, 1967. / Typescript (photocopy). Includes bibliographical references (p. 46-47). Also available on the World Wide Web.

Thesis (M. Sc.)--York University, 2003. / Typescript. Includes bibliographical references (leaves 245-252). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://wwwlib.umi.com/cr/yorku/fullcit?pMQ82950.

Thesis (M. A.)--University of New South Wales, 2002. / Also available online.

Thesis (Ph. D.)--University of Washington, 1998. / Vita. Includes bibliographical references (p. [155]-167).

Call number: LD2668 .T4 1962 C44

Thesis. 1976. M.S.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. / Microfiche copy available in Archives and Engineering. / Includes bibliographies. / by William J. Masek. / M.S.

This work investigates some of the issues and consequences for the field of artificial intelligence and cognitive science, which are related to the perceived limits of computation with current digital equipment. The Church -Turing thesis and the specific properties of Turing machines are examined and some of the philosophical 'in principle' objections, such as the application of G??del's incompleteness theorem, are discussed. It is argued that the misinterpretation of the Church-Turing thesis has led to unfounded assumptions about the limitations of computing machines in general. Modern digital computers, which are based on the von Neuman architecture, can typically be programmed so that they interact effectively with the real word. It is argued that digital computing machines are supersets of Turing machines, if they are, for example, programmed to interact with the real world. Moreover, computing is not restricted to the domain of discrete state machines. Analog computers and real or simulated neural nets exhibit properties that may not be accommodated in a definition of computing, which is based on Turing machines. Consequently, some of the philosophical 'in principle' objections to artificial intelligence may not apply in reference to engineering efforts in artificial intelligence.

Thèse doctorat : Informatique : Rennes 1 : 2005. / Bibliogr. p. [129]-132.

Thèse doctorat : Informatique : Rennes 1 : 2005. / Bibliogr. p. 193-202.

The purpose of this thesis is to develop a software system simulating Turing machines using a Microsoft Windows' Interface.Developed in the 1930's by Alan Turing and Emil Post, Turing machines are defined as "abstract computers" . These machines seem able to solve all problems a modern computer can solve, however complex the problems may be. A Turing machine is a basic computational model for algorithms.The software provides a practical tool to students with a relative notion of Turing machines. The software contains introduction and general information on Turing machines that gives the beginner enough background to use the program. The user can create, modify or run Turing machines saved onto MS-DOS files. Some examples of Turing machines are preloaded. These examples give more help to the beginner.An on-line help facility is provided in order to direct and inform the learning student at each level of the software.The Microsoft Windows' Interface makes the software easy and friendly to use. The software has the modularity which will ease any future enhancement. / Department of Computer Science