Results 1  10
of
16
The Expressiveness of a Family of Finite Set Languages
 IN PROCEEDINGS OF 10TH ACM SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS
, 1991
"... In this paper we characterise exactly the complexity of a set based database language called SRL, which presents a unified framework for queries and updates. By imposing simple syntactic restrictions on it, we are able to express exactly the classes, P and LOGSPACE. We also discuss the role of orde ..."
Abstract

Cited by 26 (3 self)
 Add to MetaCart
In this paper we characterise exactly the complexity of a set based database language called SRL, which presents a unified framework for queries and updates. By imposing simple syntactic restrictions on it, we are able to express exactly the classes, P and LOGSPACE. We also discuss the role of ordering in database query languages and show that the hom operator of Machiavelli language in [OBB89] does not capture all the orderindependent properties.
Semantics vs. Syntax vs. Computations  Machine Models For Type2 . . .
 JOURNAL OF COMPUTER AND SYSTEM SCIENCE
, 1997
"... This paper investigates analogs of the KreiselLacombeShoenfield Theorem in the context of the type2 basic feasible functionals. We develop a direct, polynomialtime analog of effective operation in which the time boundingon computations is modeled after Kapron and Cook's scheme for their basic po ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
This paper investigates analogs of the KreiselLacombeShoenfield Theorem in the context of the type2 basic feasible functionals. We develop a direct, polynomialtime analog of effective operation in which the time boundingon computations is modeled after Kapron and Cook's scheme for their basic polynomialtime functionals. We show that if P = NP, these polynomialtime effective operations are strictly more powerful on R (the class of recursive functions) than the basic feasible functions. We also consider a weaker notion of polynomialtime effective operation where the machines computing these functionals have access to the computations of their procedural parameter, but not to its program text. For this version of polynomialtime effective operations, the analog of the KreiselLacombeShoenfield is shown to holdtheir power matches that of the basic feasible functionals on R.
Extending the Loop Language with HigherOrder Procedural Variables
 Special issue of ACM TOCL on Implicit Computational Complexity
, 2010
"... We extend Meyer and Ritchie’s Loop language with higherorder procedures and procedural variables and we show that the resulting programming language (called Loop ω) is a natural imperative counterpart of Gödel System T. The argument is twofold: 1. we define a translation of the Loop ω language int ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
We extend Meyer and Ritchie’s Loop language with higherorder procedures and procedural variables and we show that the resulting programming language (called Loop ω) is a natural imperative counterpart of Gödel System T. The argument is twofold: 1. we define a translation of the Loop ω language into System T and we prove that this translation actually provides a lockstep simulation, 2. using a converse translation, we show that Loop ω is expressive enough to encode any term of System T. Moreover, we define the “iteration rank ” of a Loop ω program, which corresponds to the classical notion of “recursion rank ” in System T, and we show that both translations preserve ranks. Two applications of these results in the area of implicit complexity are described. 1
On the Expressive Power of the Loop Language
 Nordic Journal of Computing
, 2006
"... imperative programming language similar to the Loop language described by Meyer and Ritchie ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
imperative programming language similar to the Loop language described by Meyer and Ritchie
Computing nilpotent quotients in finitely presented Lie rings
 DISCRETE MATH. THEOR. COMPUT. SCI
, 1997
"... ..."
Code Problems on Traces
 Szalas (Eds.), Proc. 21st Internat. Sympos. on Mathematical Foundations of Computer Science (MFCS'96), Lecture Notes in Comput. Sci
, 1996
"... . The topic of codes in the framework of trace monoids leads to interesting and challenging decision problems of combinatorial flavour. We give an overview of the current state of some basic questions in this field. Among these, we consider the existence problem for strong codings, cliquepreserving ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. The topic of codes in the framework of trace monoids leads to interesting and challenging decision problems of combinatorial flavour. We give an overview of the current state of some basic questions in this field. Among these, we consider the existence problem for strong codings, cliquepreserving morphisms and the unique decipherability problem (code problem). 1 Introduction Free partially commutative monoids [7] offer a mathematically sound framework for modelling and analyzing concurrent systems. This was made popular by the work of Mazurkiewicz. He investigated originally the behaviour of safe 1labelled Petri nets [17] and the computer science community quickly recognized the importance of this work. The basic concept is to consider a system as a finite set of actions \Sigma , together with a fixed symmetric independence relation I ` \Sigma \Theta \Sigma , denoting pairs of actions which can be scheduled in parallel. In the setting defined by a pair (\Sigma ; I) we identify seq...
Complexity Spaces: Lifting Directedness
 Topology Proceedings 22 Summer
, 1999
"... The theory of complexity spaces has been introduced in [Sch95] as part of the development of a topological foundation for Complexity Analysis. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The theory of complexity spaces has been introduced in [Sch95] as part of the development of a topological foundation for Complexity Analysis.
A New Continuous Propositional Logic
 Proc. 7th Portuguese Conference on Artificial Intelligence, EPIA '95, number 990 in Lecture Notes in Artificial Intelligence
, 1995
"... In this paper we present Minimal Polynomial Logic (MPL), a generahsation of classical propositional logic which allows truth values in the continuous interval [0, 1] and in which propositions are represented by multivariate polynomials with integer coefficients. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper we present Minimal Polynomial Logic (MPL), a generahsation of classical propositional logic which allows truth values in the continuous interval [0, 1] and in which propositions are represented by multivariate polynomials with integer coefficients.
Computation vs. Information Processing: Why Their Difference Matters to Cognitive Science
"... Since the cognitive revolution, it’s become commonplace that cognition involves both computation and information processing. Is this one claim or two? Is computation the same as information processing? The two terms are often used interchangeably, but this usage masks important differences. In this ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Since the cognitive revolution, it’s become commonplace that cognition involves both computation and information processing. Is this one claim or two? Is computation the same as information processing? The two terms are often used interchangeably, but this usage masks important differences. In this paper, we distinguish information processing from computation and examine some of their mutual relations, shedding light on the role each can play in a theory of cognition. We recommend that theorists of cognition be explicit and careful in choosing 1 notions of computation and information and connecting them together. Much confusion can be avoided by doing so.