Related papers: Reversible Truly Concurrent Process Algebra
Extending the work of Cuntz and Vershik, we develop a general notion of independence for commuting group endomorphisms. Based on this concept, we initiate the study of irreversible algebraic dynamical systems, which can be thought of as…
We propose a logic for true concurrency whose formulae predicate about events in computations and their causal dependencies. The induced logical equivalence is hereditary history preserving bisimilarity, and fragments of the logic can be…
A novel model of reversible computing, the $\aleph$-calculus, is introduced. It is declarative, reversible-Turing complete, and has a local term-rewriting semantics. Unlike previously demonstrated reversible term-rewriting systems, it does…
Reverse Mathematics is a program in the foundations of mathematics which provides an elegant classification of theorems of ordinary mathematics based on computability. Our aim is to provide an alternative classification of theorems based on…
Using elementary cellular automata (CA) as an example, we show how to coarse-grain CA in all classes of Wolfram's classification. We find that computationally irreducible (CIR) physical processes can be predictable and even computationally…
Reversible interactions model different scenarios, like biochemical systems and human as well as automatic negotiations. We abstract interactions via multiparty sessions enriched with named checkpoints. Computations can either go forward or…
Reservoir computing (RC) is known as a powerful machine learning approach for learning complex dynamics from limited data. Here, we use RC to predict highly stochastic dynamics of cell shapes. We find that RC is able to predict the steady…
While limited coupled cluster theory is \textit{formally} nonvariational, it is not broadly appreciated whether this is a major issue \textit{in practice}. We carried out a detailed comparison with \textit{de facto} full CI energies for a…
Recurrent neural networks (RNNs) provide state-of-the-art performance in processing sequential data but are memory intensive to train, limiting the flexibility of RNN models which can be trained. Reversible RNNs---RNNs for which the…
The ability to deploy neural networks in real-world, safety-critical systems is severely limited by the presence of adversarial examples: slightly perturbed inputs that are misclassified by the network. In recent years, several techniques…
We present the problem of inverse constraint learning (ICL), which recovers constraints from demonstrations to autonomously reproduce constrained skills in new scenarios. However, ICL suffers from an ill-posed nature, leading to inaccurate…
Synchronous computation models simplify the design and the verification of fault-tolerant distributed systems. For efficiency reasons such systems are designed and implemented using an asynchronous semantics. In this paper, we bridge the…
We propose Beam Tree Recursive Cell (BT-Cell) - a backpropagation-friendly framework to extend Recursive Neural Networks (RvNNs) with beam search for latent structure induction. We further extend this framework by proposing a relaxation of…
We construct irreducible modules for twisted toroidal Lie algebras and extended affine Lie algebras. This is done by combining the representation theory of untwisted toroidal algebras with the technique of thin coverings of modules. We…
We study vertex algebras and their modules associated with possibly degenerate even lattices, using an approach somewhat different from others. Several known results are recovered and a number of new results are obtained. We also study…
We propose some backward-forward martingale decompositions for functions of reversible Markov chains. These decompositions are used to prove the functional CLT for reversible Markov chains with asymptotically linear variance of partial…
This work studies the recursive robust principal components' analysis(PCA) problem. Here, "robust" refers to robustness to both independent and correlated sparse outliers. If the outlier is the signal-of-interest, this problem can be…
We define the concept of weak pseudotwistor for an algebra $(A, \mu)$ in a monoidal category $\mathcal{C}$, as a morphism $T:A\otimes A\rightarrow A\otimes A$ in $\mathcal{C}$, satisfying some axioms ensuring that $(A, \mu \circ T)$ is also…
In this note we define a process algebra TCP (Truly Concurrent Processes) which corresponds closely with the automata model of concurrency based on Span(RGraph), the category of spans of reflexive graphs. In TCP, each process has a fixed…
The fact that closed timelike curves (CTCs) are permitted by general relativity raises the question as to how quantum systems behave when time travel to the past occurs. Research into answering this question by utilising the quantum circuit…