Related papers: On the Impossibility of a Perfect Hypervisor
A general condition determining the optimal performance of a complex system has not yet been found and the possibility of its existence is unknown. To contribute in this direction, an optimization algorithm as a complex system is presented.…
We prove that every conceivable hidden variable model reproducing the quantum mechanical predictions of almost any entangled state must necessarily violate Bell's locality condition. The proof does not involve the consideration of any Bell…
In this work, we consider the fundamental problem of reachability analysis over imperative programs with real variables. The reachability property requires that a program can reach certain target states during its execution. Previous works…
We consider the decidability of state-to-state reachability in linear time-invariant control systems over continuous time. We analyse this problem with respect to the allowable control sets, which are assumed to be the image under a linear…
Deciding termination is a fundamental problem in the analysis of probabilistic imperative programs. We consider the qualitative and quantitative probabilistic termination problems for an imperative programming model with discrete…
In light of G\"{o}del's undecidability results (incomplete theorems) for math, quantum indeterminism indicates that physics and the Universe may be indeterministic, incomplete, and open in nature, and therefore demand no single unification…
The universal approximation theorem states that a neural network with one hidden layer can approximate continuous functions on compact sets with any desired precision. This theorem supports using neural networks for various applications,…
In this paper it is showed that if a time-varying uncertain system is robustly completely detectable then there exists an estimator for this system, i.e. we can estimate asymptotically the state vector of the system. Moreover, if a…
We construct uncertainty relation for arbitrary finite dimensional PT invariant non-Hermitian quantum systems within a special inner product framework. This construction is led by good observables which are a more general class of…
In this paper we study the global scheduling of periodic task systems upon multiprocessor platforms. We first show two very general properties which are well-known for uniprocessor platforms and which remain for multiprocessor platforms:…
This paper explores and clarifies several issues surrounding Zeno machines and the issue of running a Turing machine for infinite time. Without a minimum hypothetical bound on physical conditions, any magical machine can be created, and…
The subsystem compatibility problem, which concerns the question of whether a set of subsystem states are compatible with a state of the entire system, has received much study. Here we attack the problem from a new angle, utilising the…
As artificial agents become increasingly capable, what internal structure is *necessary* for an agent to act competently under uncertainty? Classical results show that optimal control can be *implemented* using belief states or world…
We show that hereditarily indecomposable spaces can be characterized by a special instance of the Intermediate Value Theorem in their rings of continuous functions.
Our main theorem is in the generality of the axioms of Hilbert space, and the theory of unbounded operators. Consider two Hilbert spaces such that their intersection contains a fixed vector space D. It is of interest to make a precise…
We prove a nonsmooth implicit function theorem applicable to the zero set of the difference of convex functions. This theorem is explicit and global: it gives a formula representing this zero set as a difference of convex functions which…
We prove The Equivalence Theorem: structurally complete knowledge representation requires exactly four mutually entailing capabilities -- n-ary relationships with attributes, temporal validity, uncertainty quantification, and causal…
For a hidden variable theory to be indistinguishable from quantum theory for finite precision measurements, it is enough that its predictions agree for some measurement within the range of precision. Meyer has recently pointed out that the…
In this article we provide a proof of the so called absolute continuity theorem for random dynamical systems on $R^d$ which have an invariant probability measure. First we present the construction of local stable manifolds in this case.…
One-time programs are modelled after a black box that allows a single evaluation of a function, and then self-destructs. Because software can, in principle, be copied, general one-time programs exists only in the hardware token model: it…