Related papers: Multiway Turing Machines
The problem of learning simultaneously several related tasks has received considerable attention in several domains, especially in machine learning with the so-called multitask learning problem or learning to learn problem [1], [2].…
This paper introduces a new computing model based on the cooperation among Turing machines called orchestrated machines. Like universal Turing machines, orchestrated machines are also designed to simulate Turing machines but they can also…
Computational complexity theory contains a corpus of theorems and conjectures regarding the time a Turing machine will need to solve certain types of problems as a function of the input size. Nature {\em need not} be a Turing machine and,…
The truly chaotic finite machines introduced by authors in previous research papers are presented here. A state of the art in this discipline, encompassing all previous mathematical investigations, is provided, explaining how finite state…
We explore the possible connections between the dynamic behaviour of a system and Turing universality in terms of the system's ability to (effectively) transmit and manipulate information. Some arguments will be provided using a defined…
The apparent ``black box'' nature of neural networks is a barrier to adoption in applications where explainability is essential. This paper presents TAME (Trainable Attention Mechanism for Explanations), a method for generating explanation…
Multi-task neural networks learn tasks simultaneously to improve individual task performance. There are three mechanisms of multi-task learning (MTL) which are explored here for the context of structural health monitoring (SHM): (i) the…
Most modern classical processors support so-called von Neumann architecture with program and data registers. In present work is revisited similar approach to models of quantum processors. Deterministic programmable quantum gate arrays are…
This paper discusses "computational" systems capable of "computing" functions not computable by predefined Turing machines if the systems are not isolated from their environment. Roughly speaking, these systems can change their finite…
Threads as considered in basic thread algebra are primarily looked upon as behaviours exhibited by sequential programs on execution. It is a fact of life that sequential programs are often fragmented. Consequently, fragmented program…
Modeling network traffic is gaining importance in order to counter modern threats of ever increasing sophistication. It is though surprisingly difficult and costly to construct reliable classifiers on top of telemetry data due to the…
It is well-known that in two dimensions Turing systems produce spots, stripes and labyrinthine patterns, and in three dimensions lamellar and spherical structures or their combinations are observed. We study transitions between these states…
We developed analytical and numerical methods to study a transport of non-interacting particles in large networks consisting of M d-dimensional containers C_1,...,C_M with radii R_i linked together by tubes of length l_{ij} and radii a_{ij}…
We derive a set of genuine multi-mode entanglement criteria for second moments of the quadrature operators. The criteria have a common form of the uncertainty relation between sums of variances of position and momentum quadrature…
Artificial intelligence based on artificial neural networks, which are originally inspired by the biological architectures of human brain, has mostly been realized using software but executed on conventional von Neumann computers, where the…
Manin, Feynman, and Deutsch have viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum logic circuits and quantum Turing machines has shown how these machines can simulate an…
Planning long-horizon robot manipulation requires making discrete decisions about which objects to interact with and continuous decisions about how to interact with them. A robot planner must select grasps, placements, and motions that are…
Infinite time Turing machines extend the operation of ordinary Turing machines into transfinite ordinal time. By doing so, they provide a natural model of infinitary computability, a theoretical setting for the analysis of the power and…
We study a set of crossed 1D systems, which are coupled with each other via tunnelling at the crossings. We begin with the simplest case with no electron-electron interactions and find that besides the expected level splitting, bound states…
In this paper are discussed some formal properties of quantum devices necessary for implementation of nondeterministic Turing machine.