Related papers: Levels of discontinuity, limit-computability, and …
An operational definition of contextuality is introduced which generalizes the standard notion in three ways: (1) it applies to arbitrary operational theories rather than just quantum theory, (2) it applies to arbitrary experimental…
Cover's function counting theorem is a milestone in the theory of artificial neural networks. It provides an answer to the fundamental question of determining how many binary assignments (dichotomies) of $p$ points in $n$ dimensions can be…
We study the notion of recurrence and some of its variations for linear operators acting on Banach spaces. We characterize recurrence for several classes of linear operators such as weighted shifts, composition operators and multiplication…
Motivated by the recent developments of pseudo-Hermitian quantum mechanics, we analyze the structure generated by unbounded metric operators in a Hilbert space. To that effect, we consider the notions of similarity and quasi-similarity…
There are presented certain results on extending continuous linear operators defined on spaces of E-valued continuous functions (defined on a compact Hausdorff space X) to linear operators defined on spaces of E-valued measurable functions…
This article belongs to a subject, Directed Algebraic Topology, whose general aim is including non-reversible processes in the range of topology and algebraic topology. Here, as a further step, we also want to cover "critical processes",…
In this work we present a theoretical model for differentiable programming. We construct an algebraic language that encapsulates formal semantics of differentiable programs by way of Operational Calculus. The algebraic nature of Operational…
Existing models of computation, such as a Turing machine (hereafter, TM), do not consider the agent involved in interpreting the outcome of the computation. We argue that a TM, or any other computation model, has no significance if its…
In this paper we study shorted operators relative to two different subspaces, for bounded operators on infinite dimensional Hilbert spaces. We define two notions of complementability in the sense of Ando for operators, and study the…
We introduce a notion of a noncommutative function defined on a domain of $d$-tuples of bounded operators on an infinite dimensional Hilbert space. Inverse and implicit function theorems in this setting are established. When these…
Quantum open systems are described in the Markovian limit by master equations in Lindblad form. I argue that common ``quantum jumps'' techniques, which solve the master equation by unraveling its evolution into stochastic trajectories in…
We study topological boundedness of order-to-topology bounded and order-to-topology continuous operators from ordered vector spaces to topological vector spaces. The uniform boundedness principle for such operators is investigated.
Many attempts to introduce fundamental nonlocality into quantum (or classical) field theory are based on the assumption that exponentials of the d'Alembertian are positive-definite, so that these operators can be employed without…
A `whole-part' theory is developed for a set of finite quantum systems $\Sigma (n)$ with variables in ${\mathbb Z}(n)$. The partial order `subsystem' is defined, by embedding various attributes of the system $\Sigma (m)$ (quantum states,…
We give a general existence result for interacting particle systems with local interactions and bounded jump rates but noncompact state space at each site. We allow for jump events at a site that affect the state of its neighbours. We give…
In the study of quantum computation, data is represented in terms of linear operators which form a generalized model of probability, and computations are most commonly described as products of unitary transformations, which are the…
The theorem on the existence of maximal nonnegative invariant subspaces for a special class of dissipative operators in Hilbert space with indefinite inner product is proved in the paper. It is shown in addition that the spectra of the…
We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing…
Claims about recursive self-improvement in AI often slide from repeated internal revision to the possibility of qualitatively stronger capability without clearly distinguishing the underlying computational regimes. This paper gives a formal…
The primary purpose of this paper is to investigate the question of invertibility of the sum of operators. The setting is bounded and unbounded linear operators. Some interesting examples and consequences are given. As an illustrative…