Related papers: Turing Automata and Graph Machines
A general notion of a quasi-finite algebra is introduced as an algebra graded by the set of all integers equipped with topologies on the homogeneous subspaces satisfying certain properties. An analogue of the regular bimodule is introduced…
In this paper we adopt a category-theoretic approach to the conception of automata classes enjoying minimization by design. The main instantiation of our construction is a new class of automata that are hybrid between deterministic automata…
Building on the seminal work of Gromov on endomorphisms of symbolic algebraic varieties [10], we introduce a notion of cellular automata over schemes which generalize affine algebraic cellular automata in [7]. We extend known results to…
We establish links between countable algebraically closed graphs and the endomorphisms of the countable universal graph $R$. As a consequence we show that, for any countable graph $\Gamma$, there are uncountably many maximal subgroups of…
In this paper, we introduce an algebra structure denoted by InvDer algebra whose which we twist an algebra thanks to an invertible derivation, where its inverse is also a derivation. We define InvDer Lie algebras, InvDer associated…
This work introduces a general theory of universal pseudomorphisms and develops their connection to diagrammatic coherence. The main results give hypotheses under which pseudomorphism coherence is equivalent to the coherence theory of…
We introduce invertible subalgebras of local operator algebras on lattices. An invertible subalgebra is defined to be one such that every local operator can be locally expressed by elements of the inveritible subalgebra and those of the…
von Neumann algebras have been playing an increasingly important role in the context of gauge theories and gravity. The crossed product presents a natural method for implementing constraints through the commutation theorem, rendering it a…
A theory of $\infty$-properads is developed, extending both the Joyal-Lurie $\infty$-categories and the Cisinski-Moerdijk-Weiss $\infty$-operads. Every connected wheel-free graph generates a properad, giving rise to the graphical category…
We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…
The aim of this paper is to introduce and study a large class of $\mathfrak{g}$-module algebras which we call factorizable by generalizing the Gauss factorization of (square or rectangular) matrices. This class includes coordinate algebras…
Coalgebra is a currently quite active field, which aims to look at generic state-based systems (most prominently automata) from a very abstract point of view, mainly using tools from category theory. One of its achievements is to give a…
We give a definition of monoidal categorifications of quantum cluster algebras and provide a criterion for a monoidal category of finite-dimensional graded $R$-modules to become a monoidal categorification of a quantum cluster algebra,…
A new calculus of planar diagrams involving diagrammatics for biadjoint functors and degenerate affine Hecke algebras is introduced. The calculus leads to an additive monoidal category whose Grothendieck ring contains an integral form of…
This paper mainly concerns the von Neumann algebras induced by a tuple of multiplication operators on Bergman spaces which arise essentially from holomorphic proper maps over higher dimensional domains. We study the structures and abelian…
The Kuperberg Program asks to find presentations of planar algebras and use these presentations to prove results about their corresponding categories purely diagrammatically. This program has been completed for index less than 4 and is…
This work establishes a rigorous theoretical foundation for analyzing deep learning systems by leveraging Infinite Time Turing Machines (ITTMs), which extend classical computation into transfinite ordinal steps. Using ITTMs, we reinterpret…
Let W be a finite Coxeter group. We define its Hecke-group algebra by gluing together appropriately its group algebra and its 0-Hecke algebra. We describe in detail this algebra (dimension, several bases, conjectural presentation,…
This paper investigates some issues arising in categorical models of reversible logic and computation. Our claim is that the structural (coherence) isomorphisms of these categorical models, although generally overlooked, have decidedly…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…