Related papers: Context-Dependent Functions: Narrowing the Realm o…
We resolve an open problem concerning finite logical implication for path functional dependencies (PFDs).
Computational complexity characterizes the usage of spatial and temporal resources by computational processes. In the classical theory of computation, e.g. in the Turing Machine model, computational processes employ only local space and…
Representing time is crucial for cyber-physical systems and has been studied extensively in the Situation Calculus. The most commonly used approach represents time by adding a real-valued fluent $\mathit{time}(a)$ that attaches a time point…
A Hopf bifurcation theorem is established for the abstract evolution equation $\frac{\mathrm{d}x}{\mathrm{d}t}=F(x,\lambda)$ in infinite dimensions under the degeneracy condition $Re \mu ^{\prime}(\lambda_0)= 0$ and suitable assumptions.…
The use of temporal logics has long been recognised as a fundamental approach to the formal specification and verification of reactive systems. In this paper, we take on the problem of automatically verifying a temporal property, given by a…
In this work we prove the existence of solution for a class of perturbed fractional Hamiltonian systems given by \begin{eqnarray}\label{eq00} -{_{t}}D_{\infty}^{\alpha}(_{-\infty}D_{t}^{\alpha}u(t)) - L(t)u(t) + \nabla W(t,u(t)) = f(t),…
This paper provides a systematic account of the hidden variable models (HVMs) formulated to describe systems of random variables with mutually exclusive contexts. Any such system can be described either by a model with free choice but…
We introduce topological differential testing (TDT), an approach to extracting the consensus behavior of a set of programs on a corpus of inputs. TDT uses the topological notion of a simplicial complex (and implicitly draws on richer…
The self-consistent field method utilized for solving the Hartree-Fock (HF) problem and the closely related Kohn-Sham problem, is typically thought of as one of the cheapest methods available to quantum chemists. This intuition has been…
We conclude from Goedel's Theorem VII of his seminal 1931 paper that every recursive function f(x_{1}, x_{2}) is representable in the first-order Peano Arithmetic PA by a formula [F(x_{1}, x_{2}, x_{3})] which is algorithmically verifiable,…
Program transformation is an appealing technique which allows to improve run-time efficiency, space-consumption and more generally to optimize a given program. Essentially it consists of a sequence of syntactic program manipulations which…
Density Functional Theory (DFT) is one of the most widely used methods for "ab initio" calculations of the structure of atoms, molecules, crystals, surfaces, and their interactions. Unfortunately, the customary introduction to DFT is often…
In this work, we propose the concept of Construction Defining Functionality (CDF), which characterizes functions by the structural spaces they generate through iteration,recursion, and logical application. By viewing functions as generators…
A computable real function F on [0,1] is constructed such that there exists an exponential time algorithm for the evaluation of the function on [0,1] on Turing machine but there does not exist any polynomial time algorithm for the…
This article examines the time-dependent Hartree-Fock (TDHF) approximation of single-particle dynamics in systems of interacting fermions. We find the TDHF approximation to be accurate when there are sufficiently many particles and the…
We propose an operator generalization of the Li-Haldane conjecture regarding the entanglement Hamiltonian of a disk in a 2+1D chiral gapped groundstate. The logic applies to regions with sharp corners, from which we derive several universal…
In the context of the correspondence between real functions on the unit circle and inner analytic functions within the open unit disk, that was presented in previous papers, we show that the constructions used to establish that…
Assuming $\mathrm{ZF}$, we prove that Turing determinacy ($\mathrm{TD}$) implies countable choice axiom for sets of reals ($\mathrm{CCR}$).
This paper talk about the complexity of computation by Turing Machine. I take attention to the relation of symmetry and order structure of the data, and I think about the limitation of computation time. First, I make general problem named…
We present a logical system CFP (Concurrent Fixed Point Logic) supporting the extraction of nondeterministic and concurrent programs that are provably total and correct. CFP is an intuitionistic first-order logic with inductive and…