Related papers: Syntactic Structure, Quantum Weights
Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…
Classical complexity theory measures the cost of computing a function, but many computational tasks require committing to one valid output among several. We introduce determination depth -- the minimum number of sequential layers of…
The semiclassical Euclidean path integral method is applied to compute the low temperature quantum decay rate for a particle placed in the metastable minimum of a cubic potential in a {\it finite} time theory. The classical path, which…
We study an untyped lambda calculus with quantum data and classical control. This work stems from previous proposals by Selinger and Valiron and by Van Tonder. We focus on syntax and expressiveness, rather than (denotational) semantics. We…
Many proofs in discrete mathematics and theoretical computer science are based on the probabilistic method. To prove the existence of a good object, we pick a random object and show that it is bad with low probability. This method is…
Traditionally, semantic models of imperative languages use an auxiliary structure which mimics memory. In this way, ownership and other encapsulation properties need to be reconstructed from the graph structure of such global memory. We…
There has been enormous progress in the last few years in designing neural networks that respect the fundamental symmetries and coordinate freedoms of physical law. Some of these frameworks make use of irreducible representations, some make…
We calculate Euclidean correlation functions through next-to-leading order in the low energy effective theory of gravity. We focus on correlation functions of curvature and volume operators, calculating these functions through one-loop…
We introduce a weight assignment logic for reasoning about quantitative languages of infinite words. This logic is an extension of the classical MSO logic and permits to describe quantitative properties of systems with multiple weight…
The lambda calculus is a widely accepted computational model of higher-order functional pro- grams, yet there is not any direct and universally accepted cost model for it. As a consequence, the computational difficulty of reducing lambda…
Causal Dynamical Triangulations in four dimensions provide a background-independent definition of the sum over space-time geometries in nonperturbative quantum gravity. We show that the macroscopic four-dimensional world which emerges in…
We show how universal codes can be used for solving some of the most important statistical problems for time series. By definition, a universal code (or a universal lossless data compressor) can compress any sequence generated by a…
The problem of variable-rate lossless data compression is considered, for codes with and without prefix constraints. Sharp bounds are derived for the best achievable compression rate of memoryless sources, when the excess-rate probability…
Classical gravitational evolution admits an elegant and compact re-expression in terms of gauge covariant generalizations of Lie derivatives with respect to a spatial phase space dependent $su(2)$ valued vector field called the Electric…
Minimal varying $\Lambda$ theories are defined by an action built from the Einstein-Cartan-Holst first order action for gravity with the cosmological constant $\Lambda$ as an independent scalar field, and supplemented by the Euler and…
Completeness proofs in categorical semantics usually proceed by building a syntactic category whose composition is given by substitution. For untyped effectful Call-by-Value languages, this runs into a basic obstacle: there is no canonical…
Regularized coherent-state functional integrals are derived for ensembles of identical bosons on a lattice, the regularization being a discretization of Euclidian time. Convergence of the time-continuum limit is shown for various…
There is a generic way to add any new feature to a system. It involves 1) identifying the basic units which build up the system and 2) introducing the new feature to each of these basic units. In the case where the system is argumentation…
Programs with a continuous state space or that interact with physical processes often require notions of equivalence going beyond the standard binary setting in which equivalence either holds or does not hold. In this paper we explore the…
It is shown by constructing Rohlins canonical measures that for a strictly stationary, d-dimensional vector-valued process X there exists another strictly stationary d-dimensional process U with uniform one-dimensional marginals and with…