Alan Turing (1912–1954)

Minds and Machines -     

中介逻辑ML的语法完全性

中介逻辑ML(MediumLogic)是近年提出的一种非经典逻辑。在ML的系统特征理论中已证明ML具有语义完全(完备)性。本文研究了ML的语法完全性,证明了如下结果:(1)ML中的中介命题逻辑系统MP及其扩张MP*是语法完全的,中介谓词逻辑系统MF与其扩张MF*,以及含有等词的中介谓词逻辑系统ME不是语法完全的。(2)一般地,如果一个协调的逻辑形式系统不是语法完全的,则它的任何协调的扩张系统也不是语法完全的。     

H1(R)H1(x) (R)空间中广义二维可分离微商算子样条多分辨分析

This paper established a multiresolution analysis of two-dimensionseperable differential operator spline with non-polynomial type in thereproducing space H1(x)(R)H1 (R), realized the expansionof function according to the system of Dyadic extension and translation,and its coefficients of expansion was demonstrated by the value offunction accurately. Moreover, this paper provided reasonable approachand efficient method for extending the theory of two-dimension operatorspline with non-polynomial type.     

Creativity,the Turing Test,and the (Better) Lovelace Test

The Turing Test (TT) is claimed by many to be a way to test for the presence, in computers, of such ``deep' phenomena as thought and consciousness. Unfortunately, attempts to build computational systems able to pass TT (or at least restricted versions of this test) have devolved into shallow symbol manipulation designed to, by hook or by crook, trick. The human creators of such systems know all too well that they have merely tried to fool those people who interact with their systems into believing that these systems really have minds. And the problem is fundamental: the structure of the TT is such as to cultivate tricksters. A better test is one that insists on a certain restrictive epistemic relation between an artificial agent (or system) A, its output o, and the human architect H of A – a relation which, roughly speaking, obtains when H cannot account for how A produced o. We call this test the ``Lovelace Test' in honor of Lady Lovelace, who believed that only when computers originate things should they be believed to have minds.     

Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata

Recently the one-counter trace languages and the context-free trace languages have been characterized through restricted types of cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size one (so-called stl-det-R(1)-automata) that work in mode ‘=1’ and that use an external counter or pushdown store to determine the successor components within computations. Here we study the deterministic variants of these CD-systems, comparing the resulting language classes to the classes of languages defined by CD-systems of stl-det-R(1)-automata without such an external device and to some classical language families, among them in particular the classes of rational, one-counter, and context-free trace languages. In addition, we present a large number of (non-)closure properties for our language classes.     

The Constructibility of Artificial Intelligence (as Defined by the Turing Test)

The Turing Test (TT), as originally specified, centres on theability to perform a social role. The TT can be seen as a test of anability to enter into normal human social dynamics. In this light itseems unlikely that such an entity can be wholly designed in anoff-line mode; rather a considerable period of training insitu would be required. The argument that since we can pass the TT,and our cognitive processes might be implemented as a Turing Machine(TM), that consequently a TM that could pass the TT could be built, isattacked on the grounds that not all TMs are constructible in a plannedway. This observation points towards the importance of developmentalprocesses that use random elements (e.g., evolution), but in these casesit becomes problematic to call the result artificial. This hasimplications for the means by which intelligent agents could bedeveloped.     

基于1-Wire(R)的PnP设备识别

文章讨论了一种"即插即用"(PnP)设备的识别方法.该方法采用1-Wire(R)器件作为存储器存储识别信息,并已在Dallas公司的TINI(R)板得到了实际的应用.     

Completeness and Counter-Example Generations of a Basic Protocol Logic: (Extended Abstract)

We give an axiomatic system in first-order predicate logic with equality for proving security protocols correct. Our axioms and inference rules derive the basic inference rules, which are explicitly or implicitly used in the literature of protocol logics, hence we call our axiomatic system Basic Protocol Logic (or BPL, for short). We give a formal semantics for BPL, and show the completeness theorem such that for any given query (which represents a correctness property) the query is provable iff it is true for any model. Moreover, as a corollary of our completeness proof, the decidability of provability in BPL holds for any given query. In our formal semantics we consider a “trace” any kind of sequence of primitive actions, counter-models (which are generated from an unprovable query) cannot be immediately regarded as realizable traces (i.e., attacked processes on the protocol in question). However, with the aid of Comon-Treinen's algorithm for the intruder deduction problem, we can determine whether there exists a realizable trace among formal counter-models, if any, generated by the proof-search method (used in our completeness proof). We also demonstrate that our method is useful for both proof construction and flaw analysis by using a simple example.     

Computing Machines Can't Be Intelligent (...and Turing Said So)

According to the conventional wisdom, Turing (1950) said that computing machines can be intelligent. I don't believe it. I think that what Turing really said was that computing machines –- computers limited to computing –- can only fake intelligence. If we want computers to become genuinelyintelligent, we will have to give them enough initiative (Turing, 1948, p. 21) to do more than compute. In this paper, I want to try to develop this idea. I want to explain how giving computers more ``initiative' can allow them to do more than compute. And I want to say why I believe (and believe that Turing believed) that they will have to go beyond computation before they can become genuinely intelligent.