图灵机和图灵测试

阿兰?图灵为人工智能学的诞生做出了重大的贡献,本文介绍了图灵机和图灵测试,图灵机对计算机的结构、可实现性和局限性都产生了深远的影响,而图灵测试为机器能否思考的争论双方找到了一种公认的判决准则。     

图灵机和图灵测试

阿兰？图灵为人工智能学的诞生做出了重大的贡献，本文介绍了图灵机和图灵测试，图灵机对计算机的结构、可实现性和局限性都产生了深远的影响。而图灵测试为机器能否思考的争论双方找到了一种公认的判决准则。     

What Turing Did after He Invented the Universal Turing Machine

Alan Turing anticipated many areas of current research incomputer and cognitive science. This article outlines his contributionsto Artificial Intelligence, connectionism, hypercomputation, andArtificial Life, and also describes Turing's pioneering role in thedevelopment of electronic stored-program digital computers. It locatesthe origins of Artificial Intelligence in postwar Britain. It examinesthe intellectual connections between the work of Turing and ofWittgenstein in respect of their views on cognition, on machineintelligence, and on the relation between provability and truth. Wecriticise widespread and influential misunderstandings of theChurch–Turing thesis and of the halting theorem. We also explore theidea of hypercomputation, outlining a number of notional machines thatcompute the uncomputable.     

图灵机的哲学意义

人类在创造人工自然的过程在中,如果不遵循自然规律而一意孤行,其结果必然对天然自然造成级大破坏,人类最终将自食苦果,计算机技术的发展也不例外。     

Parallel Turing machines on four-dimensional input tapes

The parallel Turing machine (PTM) proposed by Wiedermann is a set of identical usual sequential Turing machines (STMs) cooperating on two common tapes: storage tape and input tape. On the other hand, due to the advances in many application areas such as motion picture processing, computer animation, virtual reality systems, and so forth, it has become increasingly apparent that the study of four-dimensional patterns is of crucial importance. Therefore, we think that the study of four-dimensional automata as a computational model of four-dimensional pattern processing is also meaningful. In this article, we propose a four-dimensional parallel Turing machine (4-PTM), and investigate some of its properties based on hardware complexity.     

图灵机及其构造研究

图灵机模型是现代计算机科学的理论基础，学习图灵机理论对于研究计算机理论有着重要的意义。本文介绍了图灵机的产生和用途，分析其基本模型以及扩展模型，并通过举例对图灵机的构造进行了探讨。     

图灵机及其构造研究

图灵机模型是现代计算机科学的理论基础,学习图灵机理论对于研究计算机理论有着重要的意义。本文介绍了图灵机的产生和用途,分析其基本模型以及扩展模型,并通过举例对图灵机的构造进行了探讨。     

The Turing Machine May Not Be the Universal Machine

Minds and Machines -     

Learning computer programming: Implementing a fractal in a Turing Machine

It is common to start a course on computer programming logic by teaching the algorithm concept from the point of view of natural languages, but in a schematic way. In this sense we note that the students have difficulties in understanding and implementation of the problems proposed by the teacher. The main idea of this paper is to show that the logical reasoning of computer programming students can be efficiently developed by using at the same time Turing Machine, cellular automata (Wolfram rule) and fractals theory via Problem-Based Learning (PBL). The results indicate that this approach is useful, but the teacher needs introducing, in an interdisciplinary context, the simple theory of cellular automata and the fractals before the problem implementation.     

On Halting Process of Quantum Turing Machine

We prove that there is no algorithm to tell whether an arbitrarily constructed Quantum Turing Machine has same time steps for different branches of computation. We, hence, cannot avoid the notion of halting to be probabilistic in Quantum Turing Machine.     

K带实时图灵机计算能力与图灵机带数的关系

本文证明了对任意整数k,至少存在一个语言能被k带实时图灵机接受,但不能被(k—1)带实时图灵机所接受,从而证明了k带图灵机计算能力严格强于(k-1)带实时图灵机。     

Machine vision: an aid in reverse Turing test

Information security is perceived as an important and vital aspect for the survival of any business. Preserving user identity and limiting the access of web resources only to the humans and restricting ‘bots’ is an ever challenging area of study. With the increase in computing power and development of newer approaches towards circumvention and reverse-engineering, the recognition gap present between the machines and the humans is said to be decreasing. Turing test and its modified versions are in place to deal with such problems and ways to resolve them by developing complex algorithms for bot prevention systems like CAPTCHA (Completely Automated Public Turing test to tell Computers and Humans Apart). This paper will deal with the use of “Machine Vision” for judging the ability of the machines to compete with humans in breaking sequences of security systems like CAPTCHA. Reverse Turing test will be put to practise here. Complex image recognition technologies and novel approaches towards using Human interactive proofs (HIP) are discussed. The progress of Turing test over the past 60 years has been paid due attention at the end. After all this experimentation, it can be said that the current machine vision is quite poor and is far worse than it is expected to be.     

基本图灵机的Petri网建模研究

该文采用Petri网这种系统描述和分析工具对基本图灵机进行了建模与分析。首先介绍了基本图灵机和Petri网的基本概念与定义,然后给出了一个利用Petri网对基本图灵机进行建模的有效算法,研究了用Petri网为基本图灵机建模的一般方法,说明了该方法的优越性,并最终以一个建模实例验证了该方法的有效性和可行性。     

图灵机模拟系统的设计与实现

图灵机模型是现代计算机科学的理论基础,学习图灵机理论对于研究计算机软件理论有重要意义。文章分析了在Von Neumann机上仿真图灵机存在的两个问题,并针对单带图灵机模型设计了一个完整的图灵机模拟系统。该模拟系统能够编译并执行图灵机程序,为基于图灵机模型或其扩展模型的理论研究提供实验平台,对构造基于中间语言解释执行的虚拟机提供实践指导。     

基于虚拟机的并行体绘制

介绍了一种基于并行虚拟机结构的体绘制算法.该算法以切片为单位来划分和组织体数据,既 降低了通信代价,也保证了各子任务的数据局部性.在任务分配时,维护并使用性能指数数据 库,自适应式地确定各个子任务,实现了负载平衡.使用一种异步二分方法,所有局部图像可以 在O(logn)时间内完成合并.针对可视化算法在虚拟机环境中的并行化实现,自行设 计并实现了一个基于TCP/IP和Socket标准开发平台.所提出的算法利用该平台而实现,系统采 用客户/服务器结构.对系统在任务规模、虚拟机规模方     

镜像图灵测试:古诗的机器识别

古诗伴随着中华文化的历史进程不断发展,有着数千年的灿烂历史,古诗将丰富的情感、有内涵的灵魂和生动的形式完美结合,表现出了中华民族语言的力量."自然语言处理是人工智能皇冠上的明珠",用机器生成语言是机器智慧的核心体现,对机器的语言进行测试是图灵测试的重要内容,用机器生成的中国古代诗词已经可以初步通过图灵测试,在普通人面前...     

Hopfield网的图灵等价性

本文给出了用Ｈｏｐｆｉｅｌｄ网计算部分递归函数的构造性证明．由于部分递归函数与图灵机等价，故Ｈｏｐｆｉｅｌｄ网与图灵机等价．     

虚拟的孪生图灵机——以双语信息处理为例

本文阐述一种虚拟的孪生图灵机,即：由两个图灵机组成的孪生并行计算机,其特征是其受限模式与派生模式分别由汉语的言即单音节字的基本符号对象和语即双音节多音节字组的符号组合解释为例加以说明。其作用在于基于它可建构理想的双语信息处理系统,即：协同智能计算系统;应用它可形成并行计算、分布计算、网格计算、虚拟计算和云计算乃至超级计算。其意义在于借助它蕴含的协同智能计算本质——虚拟与现实的关系,可把图灵可计算性、计算复杂性（其中揭示了一个基本原理——NP=P当且仅当N可有可无）和图灵测试连贯起来。     

Architecture of a Reduction-Based Parallel Inference Machine: PIM-R

This paper presents a highly parallel machine architecture for logic programs. We propose a Reduction-Based Parallel Inference Machine: PIM-R and describe the parallel execution mechanisms for PIM-R to run Prolog and Concurrent Prolog programs and sofware simulation results. PIM-R uses the structure-copy method. It also uses the only reducible goal copy method, a unique process-structuring method, and the reverse compaction method to decrease the amount, of copying and various copyingrelated operations and the number of packets passing through the network. PIM-R architecture features include the distributed shared memory for Concurrent Prolog, network nodes for efficient packet distribution, and the structure memory to store a part of structured data for reducing the copying overhead.