Related papers: The Nuisance Principle in Infinite Settings
We investigate machine models similar to Turing machines that are augmented by the operations of a first-order structure $\mathcal{R}$, and we show that under weak conditions on $\mathcal{R}$, the complexity class $\text{NP}(\mathcal{R})$…
Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger…
The Generalized Uncertainty Principle arises from the Heisenberg Uncertainty Principle when gravity is taken into account, so the leading order correction to the standard formula is expected to be proportional to the gravitational constant…
Although whether P equals NP is an important, open problem in computer science, and although Jaeger's 2008 paper, "Solving the P/NP Problem Under Intrinsic Uncertainty" (arXiv:0811.0463) presents an attempt at tackling the problem by…
This paper studies preference aggregation under uncertainty in the multi-profile framework and characterizes a new class of aggregation rules that address classical concerns about Harsanyi's (1955) utilitarian rules. Our aggregation rules,…
A variational principle for Lagrangian densities containing derivatives of real order is formulated and the invariance of this principle is studied in two characteristic cases. Necessary and sufficient conditions for an infinitesimal…
Fundamental assumptions which form the basis of models for large-scale structure in the Universe are sketched in light of a Lagrangian description of inhomogeneities. This description is introduced for Newtonian self-gravitating flows. On…
An attempt of a new kind of complexity anthropology is considered.
In the context of aggregating von Neumann-Morgenstern utilities, we show that bounded violations of the Pareto conditions characterize aggregation rules that are approximately utilitarian. When a single utility function is intended to…
In this paper we prove Chaitin's ``heuristic principle'', {\it the theorems of a finitely-specified theory cannot be significantly more complex than the theory itself}, for an appropriate measure of complexity. We show that the measure is…
We determine the exact threshold of satisfiability for random instances of a particular NP-complete constraint satisfaction problem (CSP). This is the first random CSP model for which we have determined a precise linear satisfiability…
This paper is about elliptic and parabolic partial differential operators with discontinuities in the gradient which are compatible with a Finsler norm in a sense to be made precise. Examples of this type of problems arise in a number of…
The paper presents a constraint based semantic formalism for HPSG. The syntax-semantics interface directly implements syntactic conditions on quantifier scoping and distributivity. The construction of semantic representations is guided by…
The Heisenberg uncertainty principle shows that no one can specify the values of the non-commuting canonically conjugated variables simultaneously. However, the uncertainty relation is usually applied to two incompatible measurements. We…
We consider a system of N classical particles, interacting via a smooth, short- range potential, in a weak-coupling regime. This means that N tends to infinity when the interaction is suitably rescaled. The j-particle marginals, which obey…
Linearizability is a commonly accepted consistency condition for concurrent objects. Filipovi\'{c} et al. show that linearizability is equivalent to observational refinement. However, linearizability does not permit concurrent objects to…
Given sets $\Phi_1=\{\phi_{11},...,\phi_{1u(1)}\}, ...,\Phi_{z}=\{\phi_{z1},...,\phi_{zu(z)}\}$ of boolean formulas, a formula $\omega$ follows from the conjunction $\bigwedge\Phi_i= \bigwedge \phi_{ij}$ iff $\neg \omega\wedge…
Judgment aggregation is a framework to aggregate individual opinions on multiple, logically connected issues into a collective outcome. These opinions are cast by judges, which can be for example referees, experts, advisors or jurors,…
The P versus NP problem is addressed in a context of provability and limitations on the possibility of finding sound axioms for formal theories. It is shown that if the term "constructible theory" is defined in a way which satisfies certain…
This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which…