Results 1  10
of
13
Persistent Turing Machines as a Model of Interactive Computation
, 2000
"... . Persistent Turing Machines (PTMs) are multitape machines with a persistent worktape preserved between interactions, whose inputs and outputs are dynamically generated streams of tokens (strings). They are a minimal extension of Turing Machines (TMs) that express interactive behavior. They prov ..."
Abstract

Cited by 27 (7 self)
 Add to MetaCart
(Show Context)
. Persistent Turing Machines (PTMs) are multitape machines with a persistent worktape preserved between interactions, whose inputs and outputs are dynamically generated streams of tokens (strings). They are a minimal extension of Turing Machines (TMs) that express interactive behavior. They provide a natural model for sequential interactive computation such as singleuser databases and intelligent agents. PTM behavior is characterized observationally, by inputoutput streams; the notions of equivalence and expressiveness for PTMs are defined relative to its behavior. Four different models of PTM behavior are examined: languagebased, automatonbased, functionbased, and environmentbased. A number of special subclasses of PTMs are identified; several expressiveness results are obtained, both for the general class of all PTMs and for the special subclasses, proving the conjecture in [We2] that interactive computing devices are more expressive than TMs. The methods and tool...
Paraconsistency of Interactive Computation
 In (Ed.), Workshop on Paraconsistent Computational Logic. Denmark Harms, W. (2004). Information and Meaning in Evolutionary Processes
, 2002
"... Abstract. The goal of computational logic is to allow us to model computation as well as to reason about it. We argue that a computational logic must be able to model interactive computation. We show that firstorder logic cannot model interactive computation due to the incompleteness of interaction. ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
(Show Context)
Abstract. The goal of computational logic is to allow us to model computation as well as to reason about it. We argue that a computational logic must be able to model interactive computation. We show that firstorder logic cannot model interactive computation due to the incompleteness of interaction. We show that interactive computation is necessarily paraconsistent, able to model both a fact and its negation, due to the role of the world (environment) in determining the course of the computation. We conclude that paraconsistency is a necessary property for a logic that can model interactive computation. 1
Expressiveness of $Calculus: What Matters?
 Advances in Soft Computing, Proc. of the 9th Intern. Symp. on Intelligent Information Systems IIS'2000, Bystra
, 2000
"... $calculus is a higherorder polyadic process algebra for resource bounded computation. It has been designed to handle autonomous agents, evolutionary computing, neural nets, expert systems, machine learning, and distributed interactive AI systems, in general. $calculus has builtin costoptimizati ..."
Abstract

Cited by 8 (7 self)
 Add to MetaCart
(Show Context)
$calculus is a higherorder polyadic process algebra for resource bounded computation. It has been designed to handle autonomous agents, evolutionary computing, neural nets, expert systems, machine learning, and distributed interactive AI systems, in general. $calculus has builtin costoptimization mechanism allowing to deal with nondeterminism, incomplete and uncertain information. In this paper, we investigate expressiveness of $calculus. We show that due to innitary means, it allows to express models having richer behavior than Turing machine, including cellular automata, interaction machines, neural networks, and random automata networks. We also investigate the importance of synchronization, representation of continuity, and higherorder.
$Calculus of Bounded Rational Agents: Flexible Optimization as Search under Bounded Resources in Interactive Systems
 FUNDAMENTA INFORMATICAE
, 2005
"... This paper presents a novel model for resource bounded computation based on process algebras. ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
This paper presents a novel model for resource bounded computation based on process algebras.
Evolutionary Computation as a MultiAgent Search: a $Calculus Perspective for its Completeness and Optimality
 In Proceedings of Congress on Evolutionary Computation CEC’2001
, 2001
"... Evolutionary computation in its essense represents a multiagent competitive probabilistic search. It is useful for solutions of polynomial and hard optimization problems. The solutions found by evolutionary algorithms are not guaranteed to be optimal and evolutionary search is computationally very ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(Show Context)
Evolutionary computation in its essense represents a multiagent competitive probabilistic search. It is useful for solutions of polynomial and hard optimization problems. The solutions found by evolutionary algorithms are not guaranteed to be optimal and evolutionary search is computationally very expensive. Using a generic $calculus approach to AI, based on process algebras and anytime algorithms, we show that evolutionary search can be considered a special case of $calculus k\Omega search, and we present some results about completeness, optimality and search costs for evolutionary computation. The main result of the paper is to demonstrate how using $calculus to make evolutionary computation totally optimal, i.e., how to allow to find the best quality solution with minimal search cost. 1
Expressing Evolutionary Computation, Genetic Programming, Artif icial Life, Autonomous Agents and DNABased Computing in $Calculus  Revised Version
 in $Calculus, Proc. LateBreaking Papers of the Third Annual Genetic Programming Conf. GP98, Univ. of
, 2000
"... Genetic programming, autonomous agents, artif icial life and evolutionary computation share many common ideas. They generally investigate distributed complex processes, perhaps with the ability to interact. It seems to be natural to study their behavior using process algebras, which were designed to ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
(Show Context)
Genetic programming, autonomous agents, artif icial life and evolutionary computation share many common ideas. They generally investigate distributed complex processes, perhaps with the ability to interact. It seems to be natural to study their behavior using process algebras, which were designed to handle distributed interactive systems. $calculus is a higherorder polyadic process algebra for resource bounded computation. It has been designed to handle autonomous agents, evolutionary computing, neural nets, expert systems, machine learning, and distributed interactive AI systems, in general. $calculus has builtin costoptimization mechanism allowing to deal with nondeterminism, incomplete and uncertain information. In this paper, we express in $calculus several subareas of evolutionary computation, including genetic programming, artif icial life, autonomous agents and DNAbased computing. 1
Behavior and Expressiveness of Persistent Turing Machines
, 1999
"... . Persistent Turing machines (PTMs) are multitape machines with a persistent worktape preserved between successive interactions. They are a minimal extension of Turing machines (TMs) that express interactive behavior. Their behavior is characterized by inputoutput streams; PTM equivalence and expre ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
. Persistent Turing machines (PTMs) are multitape machines with a persistent worktape preserved between successive interactions. They are a minimal extension of Turing machines (TMs) that express interactive behavior. Their behavior is characterized by inputoutput streams; PTM equivalence and expressiveness are defined relative to its behavior. Four different models of PTM behavior are examined: languagebased, automatonbased, observationbased, and functionbased. A number of special subclasses of PTMs are identified, and several expressiveness results are obtained, both for the general class of all PTMs and for the special subclasses. The methods, formalisms, and tools for studying models of PTM computation developed in this paper can serve as a basis for a more comprehensive theory of interactive computation. 1. Introduction Persistent Turing Machines (PTMs) are multitape machines with a persistent worktape preserved between successive interactions; they are a minimal extension o...
AN ALGEBRA OF FIXPOINTS FOR CHARACTERIZING INTERACTIVE BEHAVIOR OF INFORMATION SYSTEMS
, 2001
"... ..."
Dialogs and Interaction Schema: Characterizing the Interaction Space of Information Systems
"... Information systems design concern modeling systems that are dynamic in nature. A dynamic system essentially has two dimensions of concern  static structure and dynamic behavior. The existence of dynamics  or interactions among parts of the system distinguish a dynamic system from a heap or coll ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Information systems design concern modeling systems that are dynamic in nature. A dynamic system essentially has two dimensions of concern  static structure and dynamic behavior. The existence of dynamics  or interactions among parts of the system distinguish a dynamic system from a heap or collection of parts. Specification and management of the static aspects of an information system like the data and metadata have been fairly well addressed by existing paradigms. However an understanding of the dynamic nature of information systems is still low. Currently most paradigms model behavioral properties above an existing structural model, resulting in what may be called "entity centric" modeling. Such a kind of modeling would neglect properties that can be attributed to behavioral processes themselves, and relationships that might exist among such processes. In this paper, we address behavioral modeling by first considering system behavior to be in the form of an abstract "interaction...
Interaction, Computability, and Church's Thesis
, 1999
"... : This article formalizes the claim that interactive finite computing agents are more expressive than Turing machines. The impact of models of interaction on Church's thesis and Godel's incompleteness result is explored. The evolution from algorithmic to interactive models of computation i ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
: This article formalizes the claim that interactive finite computing agents are more expressive than Turing machines. The impact of models of interaction on Church's thesis and Godel's incompleteness result is explored. The evolution from algorithmic to interactive models of computation in computer architecture, software engineering, and AI is considered in a final section. Contents 1. Interaction Machines 1.1. Sequential Interaction Machines (SIMs) 1.2. Interactive Behavior and Expressiveness 1.3. MultiStream Interaction Machines (MIMs) 2. Extensions of Expressiveness 2.1. Interactive Extensions of Machines, Sets, and Algebras 2.2. Interactive Extensions of the ChurchTuring Thesis 3. Mathematical Models of Interaction 3.1. NonWellFounded Set Theory 3.2. Coalgebras 3.3. Beyond NonWellFounded Sets 4. From Induction to Coinduction 4.1. The Inductive Modeling Paradigm 4.2. Coinduction and Greatest Fixed Points 5. Metamathematics of Coinduction 5.1. From Formal Mode...