Related papers: Truly Concurrent Process Algebra Is Reversible
We present an infinite family of formulas with reversal whose avoidability index is bounded between 4 and 5, and we show that several members of the family have avoidability index 5. This family is particularly interesting due to its size…
Reversible computing basically means computation with less or not at all electrical power. Since the standard binary gates are not usually reversible we use the Fredkin gate in order to achieve reversibility. An algorithm for designing…
In most presentations of ACP with guarded recursion, recursive specifications are finite or infinite sets of recursion equations of which the right-hand sides are guarded terms. The completeness with respect to bisimulation equivalence of…
We investigate replicable learning algorithms. Ideally, we would like to design algorithms that output the same canonical model over multiple runs, even when different runs observe a different set of samples from the unknown data…
Reversible computing has emerged as a possible low cost alternative to conventional computing in terms of speed, power consumption and computing capability. In order to achieve reliable circuits in reversible computing, provision for fault…
A compatible associative algebra is a vector space endowed with two associative multiplication operations that satisfy a natural compatibility condition. In this paper, we investigate and classify compatible pairs of associative algebras of…
For any partial combinatory algebra (PCA for short) A, the class of A-representable partial functions from N to A quotiented by the filter of cofinite sets of N, is a PCA such that the representable partial functions are exactly the…
In this paper we describe a model of concurrency together with an algebraic structure reflecting the parallel composition. For the sake of simplicity we restrict to linear concurrent programs i.e. the ones with no loops nor branching. Such…
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs,…
This paper falls within the general program of investigating the proof theoretic strength (in terms of reverse mathematics) of combinatorial principals which follow from versions of Ramsey's theorem. We examine two statements in graph…
We generalise the notion of separable equivalence, originally presented by Linckelmann (2011), to an equivalence relation on additive categories. We use this generalisation to show that from an initial equivalence between two algebras we…
This article belongs to a subject, Directed Algebraic Topology, whose general aim is including non-reversible processes in the range of topology and algebraic topology. Here, as a further step, we also want to cover "critical processes",…
Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…
Reversible computing is motivated by both pragmatic and foundational considerations arising from a variety of disciplines. We take a particular path through the development of reversible computation, emphasizing compositional reversible…
In this expository article, we give a self-contained introduction to the wonderfully well-behaved class of pseudocompact algebras, focusing on the foundational classes of semisimple and separable algebras. We give characterizations of such…
With distributed computing and mobile applications becoming ever more prevalent, synchronizing diverging replicas of the same data is a common problem. Reconciliation -- bringing two replicas of the same data structure as close as possible…
This paper studies absolute retracts in congruence modular varieties of universal algebras. It is shown that every absolute retract with finite dimensional congruence lattice is a product of subdirectly irreducible algebras. Further, every…
A dominant cost for query evaluation in modern massively distributed systems is the number of communication rounds. For this reason, there is a growing interest in single-round multiway join algorithms where data is first reshuffled over…
While a characterization of unavoidable formulas (without reversal) is well-known, little is known about the avoidability of formulas with reversal in general. In this article, we characterize the unavoidable formulas with reversal that…
We study Basic Arithmetic, BA introduced by W. Ruitenburg. BA is an arithmetical theory based on basic logic which is weaker than intuitionistic logic. We show that the class of the provably total recursive functions of BA is a proper…