Related papers: Context-Dependent Functions: Narrowing the Realm o…
We study the correctness of automatic differentiation (AD) in the context of a higher-order, Turing-complete language (PCF with real numbers), both in forward and reverse mode. Our main result is that, under mild hypotheses on the primitive…
The main purpose of this paper is to derive a new perturbation theory (PT) that has converging series. Such series arise in the nonlocal scalar quantum field theory (QFT) with fractional power potential. We construct PT for the generating…
Many of the traditional recommendation algorithms are designed based on the fundamental idea of mining or learning correlative patterns from data to estimate the user-item correlative preference. However, pure correlative learning may lead…
This paper continues a systematic and comprehensive study on the structural properties of CFL functions, which are in general multi-valued partial functions computed by one-way one-head nondeterministic pushdown automata equipped with…
We introduce $\textit{PCFTL (Probabilistic CounterFactual Temporal Logic)}$, a new probabilistic temporal logic for the verification of Markov Decision Processes (MDP). PCFTL is the first to include operators for causal reasoning, allowing…
We prove that the existential theory of any function field $K$ of characteristic $p> 0$ is undecidable in the language of rings provided that the constant field does not contain the algebraic closure of a finite field. We also extend the…
Nondeterministic choice is a useful program construct that provides a way to describe the behaviour of a program without specifying the details of possible implementations. It supports the stepwise refinement of programs, a method that has…
Process calculi based in logic, such as $\pi$DILL and CP, provide a foundation for deadlock-free concurrent programming, but exclude non-determinism and races. HCP is a reformulation of CP which addresses a fundamental shortcoming: the…
Dynamical Systems theory generally deals with fixed point iterations of continuous functions. Computation by Turing machine although is a fixed point iteration but is not continuous. This specific category of fixed point iterations can only…
We show the problem of counting homomorphisms from the fundamental group of a homology $3$-sphere $M$ to a finite, non-abelian simple group $G$ is #P-complete, in the case that $G$ is fixed and $M$ is the computational input. Similarly,…
I apply some of the lessons from quantum theory, in particular from Bell's theorem, to a debate on the foundations of decision theory and causation. By tracing a formal analogy between the basic assumptions of Causal Decision Theory…
We resolve three long-standing open problems, namely the (algorithmic) decidability of network coding, the decidability of conditional information inequalities, and the decidability of conditional independence implication among random…
A common assumption in causal inference from observational data is that there is no hidden confounding. Yet it is, in general, impossible to verify this assumption from a single dataset. Under the assumption of independent causal mechanisms…
This paper explores undecidability in theories of positive characteristic function fields in the "geometric" language of rings $\mathcal{L}_F = \{0, 1, +, \cdot, F\}$, with a unary predicate $F$ for nonconstant elements. In particular we…
The problem of defining and locating free will (FW) in physics is studied. On basis of logical paradoxes, we argue that FW has a meta-theoretic character, like the concept of truth in Tarski's undefinability theorem. Free will exists…
This paper is concerned with rule-based programs that go wrong. The unwanted behavior of rule applications is non-termination or failure of a computation. We propose a static program analysis of the non-termination problem for recursion in…
Fluctuation theorems (FTs) quantify the thermodynamic reversibility of a system, and for deterministic systems they are defined in terms of the dissipation function. However, in a nonequilibrium steady state of deterministic dynamics, the…
A universal differential equation is a nontrivial differential equation the solutions of which approximate to arbitrary accuracy any continuous function on any interval of the real line. On the other hand, there has been much interest in…
The uniform continuity theorem (UCT) states that every pointwise continuous real-valued function on the unit interval is uniformly continuous. In constructive mathematics, UCT is stronger than the decidable fan theorem (DFT); however, Loeb…
In this paper, we investigate problems which are dual to the unification problem, namely the Fixed Point (FP) problem, Common Term (CT) problem and the Common Equation (CE) problem for string rewriting systems. Our main motivation is…