Related papers: Turing Automata and Graph Machines

The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…

We introduce notions of open-string vertex algebra, conformal open-string vertex algebra and variants of these notions. These are ``open-string-theoretic,'' ``noncommutative'' generalizations of the notions of vertex algebra and of…

We begin by introducing an algebraic structure with three constants and one ternary operation to which we call mobi algebra. This structure has been designed to capture the most relevant properties of the unit interval that are needed in…

We consider the computational model of the Queue Automaton. An old result is that the deterministic queue automaton is equally expressive as the Turing machine. We introduced the Reactive Turing Machine, enhancing the Turing machine with a…

Cognitive computation such as e.g. language processing, is conventionally regarded as Turing computation, and Turing machines can be uniquely implemented as nonlinear dynamical systems using generalized shifts and subsequent G\"odel…

This is a book on weighted tree automata. We present the basic definitions and some of the important results in a coherent form with full proofs. The concept of weighted tree automata is part of Automata Theory and it touches the area of…

Purpose: This study extends the structural theory of finite commutative ternary $\Gamma$-semirings into a computational and categorical framework for explicit classification and constructive reasoning. Methods: Constraint-driven enumeration…

We introduce a new class of C^*-algebras, which is a generalization of both graph algebras and homeomorphism C^*-algebras. This class is very large and also very tractable. We prove the so-called gauge-invariant uniqueness theorem and the…

We consider the tube algebra of a spherical semisimple multitensor category $\mathcal{X}$, and construct a braided monoidal structure with twist for its representations. We further show that this category is braided tensor equivalent with…

We propose a graphical language that accommodates two monoidal structures: a multiplicative one for pairing and an additional one for branching. In this colored PROP, whether wires in parallel are linked through the multiplicative structure…

We introduce a concept of approximately invertible elements in non-unital normed algebras which is, on one side, a natural generalization of invertibility when having approximate identities at hand, and, on the other side, it is a direct…

For a finite group $G$, we construct a simplified model for the $G$-symmetric monoidal $G$-$\infty$-category of rational $G$-spectra. Using this model, we classify $\mathcal{I}$-normed algebras in rational $G$-spectra for a given indexing…

We introduce a notion of parity for formal morphisms between invertible objects and use it to prove a corresponding coherence theorem. Parity is conceptually similar to the sign of underlying permutations, but not defined as such. To give…

We propose reactive Turing machines (RTMs), extending classical Turing machines with a process-theoretical notion of interaction, and use it to define a notion of executable transition system. We show that every computable transition system…

We prove two results on the tube algebras of rigid C$^*$-tensor categories. The first is that the tube algebra of the representation category of a compact quantum group $G$ is a full corner of the Drinfeld double of $G$. As an application…

We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves…

A finite tensor category is called pointed if all its simple objects are invertible. We find necessary and sufficient conditions for two pointed semisimple categories to be dual to each other with respect to a module category. Whenever the…

We describe various computational models based initially, but not exclusively, on that of the Turing machine, that are generalized to allow for transfinitely many computational steps. Variants of such machines are considered that have…

The complexity of cellular automata is traditionally measured by their computational capacity. However, it is difficult to choose a challenging set of computational tasks suitable for the parallel nature of such systems. We study the…

We introduce two families of diagrammatic monoidal supercategories. The first family, depending on an associative superalgebra, generalizes the oriented Brauer category. The second, depending on an involutive superalgebra, generalizes the…