Please do not quote from this version, which may have changed slightly in proof. 5300 words. By allowing any social institution to structure activity in any place, wireless information services break down the traditional mapping between institutions and places. This phenomenon greatly complicates the analysis of context for purposes of designing context-aware computing systems. Context has a physical, architectural aspect, but most aspects of context will also be defined in institutional terms. This paper develops two conceptual frameworks for the analysis of context in mobile and ubiquitous computing. The first framework concerns the relationship between architecture, practices, and institutions; it directs attention to the complex middle ground in which information services make use of whatever computational resources happen to be in the user's physical surroundings. The second framework is called the capture model; it rationally reconstructs the traditional systems analysis methods, which reorganize work activities to enable a computer to capture the information it needs. Context-aware computing devices that depart from the capture model face a difficult set of design trade-offs. 1

This paper traces the important steps in the history --up to around 1990-- of research on reasoning about programs. The main focus is on sequential imperative programs but some comments are made on concurrency. Initially, researchers focussed on ways of verifying that a program satisfies its specification (or that two programs were equivalent). Over time it became clear that post facto verification is only practical for small programs and attention turned to verification methods which support the development of programs; for larger programs it is necessary to exploit a notation of compositionality. Coping with concurrent algorithms is much more challenging -- this and other extensions are considered briefly. The main thesis of this paper is that the idea of reasoning about programs has been around since they were first written; the search has been to find tractable methods.

We describe a possible physical device that computes a function that cannot be computed by a Turing machine. The device is physical in the sense that it is compatible with General Relativity. We discuss some objections, focusing on those which deny that the device is either a computer or computes a function that is not Turing computable. Finally, we argue that the existence of the device does not refute the Church–Turing thesis, but nevertheless may be a counterexample to Gandy’s thesis.

markj @ oregon.uoregon.edu and rohrer @ cogsci.ucsd.edu © 2003-2007 by the authors, pre-press final draft 4/7/07 citation information:

Abstract not found

Abstract. The Turing Test is one of the most disputed topics in arti cial intelligence, philosophy of mind, and cognitive science. This paper is a review of the past 50 years of the Turing Test. Philosophical debates, practical developments and repercussions in related disciplines are all covered. We discuss Turing's ideas in detail and present the important comments that have been made on them. Within this context, behaviorism, consciousness, the `other minds ' problem, and similar topics in the philosophy of mind are discussed. We also cover the sociological and psychological aspects of the Turing Test. Finally, welook at the current situation and analyze the programs that have been developed with the aim of passing the Turing Test. We conclude that the Turing Test has been, and will continue to be, an in uential and controversial topic.

LA-UR-95-806 Quantum cryptography is a new method for secret communications offering the ultimate security assurance of the inviolability of a Law of Nature. In this paper we shall describe the theory of quantum cryptography, its potential relevance and the development of a prototype system at Los Alamos, which utilises the phenomenon of single-photon interference to perform quantum cryptography over an optical fiber communications link. 1.

This paper traces the important steps in the history --up to around 1990-- of research on reasoning about programs. The main focus is on sequential imperative programs but some comments are made on concurrency. Initially, researchers focussed on ways of verifying that a program satifies its specification (or that two programs were equivalent). Over time it has become clear that post facto verification is only practical for small programs and attention turned to verification methods which support the development of programs; for larger programs it is necesary to exploit a notion of composability.

Games are used to evaluate and advance Multiagent and Artificial Intelligence techniques. Most of these games are deterministic with perfect information (e.g. Chess and Checkers). A deterministic game has no chance element and in a perfect information game, all information is visible to all players. However, many real-world scenarios with competing agents are stochastic (non-deterministic) with imperfect information. For two-player zero-sum perfect recall games, a recent technique called Counterfactual Regret Minimization (CFR) computes strategies that are provably convergent to an ε-Nash equilibrium. A Nash equilibrium strategy is useful in two-player games since it maximizes its utility against a worst-case opponent. However, for multiplayer (three or more player) games, we lose all theoretical guarantees for CFR. However, we believe that CFR-generated

It is not widely realised that Turing was probably the first person to consider building computing machines out of simple, neuron-like elements connected together into networks in a largely random manner. Turing called his networks `unorganised machines'. By the application of what he described as 'appropriate interference, mimicking education' an unorganised machine can be trained to perform any task that a Turing machine can carry out, provided the number of 'neurons' is sufficient. Turing proposed simulating both the behaviour of the network and the training process by means of a computer program. We outline Turing's connectionist project of 1948.