Related papers: Turing Automata and Graph Machines
We introduce a class of permutation centralizer algebras which underly the combinatorics of multi-matrix gauge invariant observables. One family of such non-commutative algebras is parametrised by two integers. Its Wedderburn-Artin…
A functor from the category of directed trees with inclusions to the category of commutative C*-algebras with injective *-homomorphisms is constructed. This is used to define a functor from the category of directed graphs with inclusions to…
A twisting system is one of the major tools to study graded algebras, however, it is often difficult to construct a (non-algebraic) twisting system if a graded algebra is given by generators and relations. In this paper, we show that a…
This thesis provides an introduction to the various category theory ideas employed in topological quantum field theory. These theories are viewed as symmetric monoidal functors from topological cobordism categories into the category of…
We decribe the correspondence between normalised $\omega$-operads and certain lax monoidal structures on the category of globular sets. As with ordinary monoidal categories, one has a notion of category enriched in a lax monoidal category.…
Geometrical Computation as a new model of computation is the counterpart of Cellular Automata that has Turing computing ability. In this paper we provide an algorithm to simulate Alternating Turing Machine in the context of Signal Machine…
We show that if two $m$-homogeneous algebras have Morita equivalent graded module categories, then they are quantum-symmetrically equivalent, that is, there is a monoidal equivalence between the categories of comodules for their associated…
This paper provides a conceptual study of the twisting procedure, which amounts to create functorially new differential graded Lie algebras, associative algebras or operads (as well as their homotopy versions) from a Maurer--Cartan element.…
Let $\Gamma$ be a connected bridgeless metric graph, and fix a point $v$ of $\Gamma$. We define combinatorial iterated integrals on $\Gamma$ along closed paths at $v$, a unipotent generalization of the usual cycle pairing and the…
Recursive coalgebras provide an elegant categorical tool for modelling recursive algorithms and analysing their termination and correctness. By considering coalgebras over categories of suitably indexed families, the correctness of the…
Toroidal Lie algebras are universal central extentions of the finite dimensional simple Lie algbera tensored with Laurent Polynomials in several commuteing variables. In this paper we classify irreducible integrable modules for Toroidal Lie…
This is a paper in a series systematically to study toroidal vertex algebras. Previously, a theory of toroidal vertex algebras and modules was developed and toroidal vertex algebras were explicitly associated to toroidal Lie algebras. In…
For computation, there existed Turing machine and later-matured automata theory. For low-level parallel computation, there existed variants of Turing machine, such as two-tapes Turing machine and multi-tapes Turing machine. In the…
We show that a structural matrix algebra $A$ is isomorphic to the endomorphism algebra of an algebraic-combinatorial object called a generalized flag. If the flag is equipped with a group grading, an algebra grading is induced on $A$. We…
It is shown that the *-algebra of all (closed densely defined linear) operators affiliated with a finite type I von Neumann algebra admits a unique center-valued trace, which turns out to be, in a sense, normal. It is also demonstrated that…
Cluster algebras are a class of commutative algebras whose generators are defined by a recursive process called mutation. We give a brief introduction to cluster algebras, and explain how discrete integrable systems can appear in the…
We introduce and study kernel algebras, i.e., algebras in the category of sheaves on a square of a scheme, where the latter category is equipped with a monoidal structure via a natural convolution operation. We show that many interesting…
The Toroidal Lie algebras are n variable genaralizations of Affine Kac-Moody Lie algebras. As in the affine Lie algebras there exists finite order auto= morphisms corresponding to Dynkin diagram automorphisms. The fixed point sub= algebras…
Monoidal algebraic structures consist of operations that can have multiple outputs as well as multiple inputs, which have applications in many areas including categorical algebra, programming language semantics, representation theory,…
We describe a method to axiomatize computations in deterministic Turing machines. When applied to computations in non-deterministic Turing machines, this method may produce contradictory (and therefore trivial) theories, considering…