Results 1 
8 of
8
Algorithms: A quest for absolute definitions
 Bulletin of the European Association for Theoretical Computer Science
, 2003
"... y Abstract What is an algorithm? The interest in this foundational problem is not only theoretical; applications include specification, validation and verification of software and hardware systems. We describe the quest to understand and define the notion of algorithm. We start with the ChurchTurin ..."
Abstract

Cited by 20 (9 self)
 Add to MetaCart
(Show Context)
y Abstract What is an algorithm? The interest in this foundational problem is not only theoretical; applications include specification, validation and verification of software and hardware systems. We describe the quest to understand and define the notion of algorithm. We start with the ChurchTuring thesis and contrast Church's and Turing's approaches, and we finish with some recent investigations.
Interactive smallstep algorithms I: Axiomatization,
, 2006
"... In earlier work, the Abstract State Machine Thesis — that arbitrary algorithms are behaviorally equivalent to abstract state machines — was established for several classes of algorithms, including ordinary, interactive, smallstep algorithms. This was accomplished on the basis of axiomatizations o ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
In earlier work, the Abstract State Machine Thesis — that arbitrary algorithms are behaviorally equivalent to abstract state machines — was established for several classes of algorithms, including ordinary, interactive, smallstep algorithms. This was accomplished on the basis of axiomatizations of these classes of algorithms. Here we extend the axiomatization and, in a companion paper, the proof, to cover interactive smallstep algorithms that are not necessarily ordinary. This means that the algorithms (1) can complete a step without necessarily waiting for replies to all queries from that step and (2) can use not only the environment’s replies but also the order in which the replies were received.
What Is an Algorithm
 SOFSEM, Lecture Notes in
"... We present a twopart exposition on the notion of algorithm and foundational analyses of computation. The first part is below, and the second is here: ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
We present a twopart exposition on the notion of algorithm and foundational analyses of computation. The first part is below, and the second is here:
Microsoft
"... Infons are statements viewed as containers of information (rather then representations of truth values). The logic of infons turns out to be a conservative extension of logic known as constructive or intuitionistic. Distributed Knowledge Authorization Language uses additional unary connectives “p sa ..."
Abstract
 Add to MetaCart
(Show Context)
Infons are statements viewed as containers of information (rather then representations of truth values). The logic of infons turns out to be a conservative extension of logic known as constructive or intuitionistic. Distributed Knowledge Authorization Language uses additional unary connectives “p said ” and “p implied ” where p ranges over principals. Here we investigate infon logic and a narrow but useful primal fragment of it. In both cases, we develop model theory and analyze the derivability problem: Does the given query follow from the given hypotheses? Our more involved technical results are on primal infon logic. We construct an algorithm for the multiple derivability problem: Which of the given queries follow from the given hypotheses? Given a bound on the quotation depth of the hypotheses, the algorithm runs in linear time. We quickly discuss the significance of this result for access control.
WHAT IS AN ALGORITHM? (REVISED)
"... Abstract. We put the title problem and Church’s thesis into a proper perspective, and we address some common misconceptions about Turing’s analysis of computation. In addition, we comment on two approaches to the title problem, one well known among philosophers and another well known among logicians ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We put the title problem and Church’s thesis into a proper perspective, and we address some common misconceptions about Turing’s analysis of computation. In addition, we comment on two approaches to the title problem, one well known among philosophers and another well known among logicians.
Programmable reconfiguration of Physarum
, 901
"... Plasmodium of Physarum polycephalum is a large cell capable of solving graphtheoretic, optimization and computational geometry problems due to its unique foraging behavior. Also the plasmodium is unique biological substrate that mimics universal storage modification machines, namely the KolmogorovU ..."
Abstract
 Add to MetaCart
(Show Context)
Plasmodium of Physarum polycephalum is a large cell capable of solving graphtheoretic, optimization and computational geometry problems due to its unique foraging behavior. Also the plasmodium is unique biological substrate that mimics universal storage modification machines, namely the KolmogorovUspensky machine. In the plasmodium implementation of the storage modification machine data are represented by sources of nutrients and memory structure by protoplasmic tubes connecting the sources. In laboratory experiments and simulation we demonstrate how the plasmodiumbased storage modification machine can be programmed. We show execution of the following operations with active zone (where computation occurs): merge two active zones, multiple active zone, translate active zone from one data site to another, direct active zone. Results of the paper bear twofold value: they provide a basis for programming unconventional devices based on biological substrates and also shed light on behavioral patterns of the plasmodium. Keywords: Physarum polycephalum, KolmogorovUspensky machine, pattern formation, morphogenesis, graph theory