Related papers: Undecidability of Inferring Linear Integer Invaria…
We introduce the notion of porous invariants for multipath (or branching/nondeterministic) affine loops over the integers; these invariants are not necessarily convex, and can in fact contain infinitely many 'holes'. Nevertheless, we show…
We construct a probabilistic finite automaton (PFA) with 7 states and an input alphabet of 5 symbols for which the PFA Emptiness Problem is undecidable. The only input for the decision problem is the starting distribution. For the proof, we…
We extend a recent result of McKenzie, and show that it is an undecidable problem to determine if 4 appears in the typeset of a finitely generated, locally finite variety.
We consider a family U of finite universes. The second order quantifier Q_R, means for each u in U quantifying over a set of n(R)-place relations isomorphic to a given relation. We define a natural partial order on such quantifiers called…
This paper deals with strong versions of input-to-state stability and integral input-to-state stability of infinite-dimensional linear systems with an unbounded input operator. We show that infinite-time admissibility with respect to inputs…
Today's quantum field theory (QFT) relies heavenly on canonical quantization (CQ), which fails for $\varphi^4_4$ leading only to a "free" result. Affine quantization (AQ), an alternative quantization procedure, leads to a "non-free" result…
The notion of integrability is discussed for classical nonautonomous systems with one degree of freedom. The analysis is focused on models which are linearly spanned by finite Lie algebras. By constructing the autonomous extension of the…
When two spatially separated parties make measurements on an unknown entangled quantum state, what correlations can they achieve? How difficult is it to determine whether a given correlation is a quantum correlation? These questions are…
We correct our proof of a theorem stating that satisfiability of frequency linear-time temporal logic is undecidable [TASE 2012].
We point out that some questions in quantum field theory are undecidable in a precise mathematical sense. More concretely, it will be demonstrated that there is no algorithm answering whether a given 2d supersymmetric Lagrangian theory…
Two results are presented concerning the entailment problem in Separation Logic with inductively defined predicate symbols and theory reasoning. First, we show that the entailment problem is undecidable for rules with bounded tree-width, if…
Machine learning researchers and practitioners steadily enlarge the multitude of successful learning models. They achieve this through in-depth theoretical analyses and experiential heuristics. However, there is no known general-purpose…
We study systems of polynomial equations in infinite finitely generated commutative associative rings with an identity element. For each such ring $R$ we obtain an interpretation by systems of equations of a ring of integers $O$ of a finite…
It is shown that if a real value PL-invariant of closed combinatorial manifolds admits a local formula that depends only on the f-vector of the link of each vertex, then the invariant must be a constant times the Euler characteristic.
In this communication, we resolve a longstanding open question in the probabilistic verification of infinite-state systems. We show that model checking {\it stateless probabilistic pushdown systems (pBPA)} against {\it probabilistic…
We study the problem of Quantum Likelihood Operators (LO) and their connection with quantum Fisher information (QFI). It is observed that the present approaches to this problem tacitly assume commutativity of parametrised density matrix…
Quantum discord (QD) measures the fraction of the pairwise mutual information that is locally inaccessible, in a multipartite system. Fundamental aspects related to two important measures in quantum information theory the Entanglement of…
Automated program verification is a difficult problem. It is undecidable even for transition systems over Linear Integer Arithmetic (LIA). Extending the transition system with theory of Arrays, further complicates the problem by requiring…
The paper studies problems of satisfiability, decidability and admissibility of inference rules, conceptions of knowledge and agent's knowledge in non-transitive temporal linear logic LTL(Past,m). We find algorithms solving mentioned…
These lecture notes cover classical undecidability results in number theory, Hilbert's 10th problem and recent developments around it, also for rings other than the integers. It also contains a sketch of the authors result that the integers…