Related papers: The Omega Rule is $\mathbf{\Pi_{1}^{1}}$-Complete …
In this paper, we define a new realizability semantics for the simply typed lambda-mu-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. We also prove a completeness result of our realizability…
The $\lambda$-calculus is a handy formalism to specify the evaluation of higher-order programs. It is not very handy, however, when one interprets the specification as an execution mechanism, because terms can grow exponentially with the…
Bell's theorem rests on the following fundamental condition for a local system: P(a,b|alpha, beta, lambda)= P(a|alpha, lambda)P(b|beta, lambda). Here a and b are the outcomes respectively for measurements alpha on one side, and beta on the…
This paper considers the quantum query complexity of {\it $\eps$-biased oracles} that return the correct value with probability only $1/2 + \eps$. In particular, we show a quantum algorithm to compute $N$-bit OR functions with…
Schinzel and W\'ojcik have shown that if $\alpha, \beta$ are rational numbers not $0$ or $\pm 1$, then $\mathrm{ord}_p(\alpha)=\mathrm{ord}_p(\beta)$ for infinitely many primes $p$, where $\mathrm{ord}_p(\cdot)$ denotes the order in…
We study the computability-theoretic complexity and proof-theoretic strength of the following statements: (1) "If X is a well-ordering, then so is epsilon_X", and (2) "If X is a well-ordering, then so is phi(alpha,X)", where alpha is a…
In this paper, we establish a $q$-integral formula by using the orthogonality relation, and also provide a new proof of the $q$-orthogonality relation for the continuous $q$-ultraspherical polynomials. A new $q$-beta integral with five…
A first-order theory $T$ is a model-complete core theory if every first-order formula is equivalent modulo $T$ to an existential positive formula; the core companion of a theory $T$ is a model-complete core theory $S$ such that every model…
We intimate deeper connections between the Riemann zeta and gamma functions than often reported and further derive a new formula for expressing the value of $\zeta(2n+1)$ in terms of zeta at other fractional points. This paper also…
Van Lambalgen's theorem states that a pair $(\alpha,\beta)$ of bitsequences is Martin-L\"of random if and only if $\alpha$ is Martin-L\"of random and $\beta$ is Martin-L\"of random relative to $\alpha$. In [Information and Computation 209.2…
We consider the sinh-Poisson equation $$(P)_\lambda\quad -\Delta u=\la\sinh u\ \hbox{in}\ \Omega,\ u=0\ \hbox{on}\ \partial\Omega,$$ where $\Omega$ is a smooth bounded domain in $\rr^2$ and $\lambda$ is a small positive parameter. If…
We shall prove that if $N=p^\alpha q_1^{2\beta_1} q_2^{2\beta_2} \cdots q_{r-1}^{2\beta_{r-1}}$ is an odd perfect number such that $p, q_1, \ldots, q_{r-1}$ are distinct primes, $p\equiv\alpha\equiv 1\mod{4}$ and $t$ divides $2\beta_i+1$…
In this paper, we build some ergodic theorems involving function $\Omega$, where $\Omega(n)$ denotes the number of prime factors of a natural number $n$ counted with multiplicities. As a combinatorial application, it is shown that for any…
Let $\{v_{\alpha}\}$ be a system of polynomial solutions of the parabolic equation $a_{hk}\partial_{x_{h}x_{k}}u - \partial_t u =0$ in a bounded $C^1$-cylinder $\Omega_{T}$ contained in $\mathbb{R}^{n+1}$. Here $a_{hk}\partial_{x_{h}x_{k}}$…
We study the Case sum rules, especially $C_0$, for general Jacobi matrices. We establish situations where the sum rule is valid. Applications include an extension of Shohat's theorem to cases with an infinite point spectrum and a proof that…
Probabilistic omega-automata are variants of nondeterministic automata for infinite words where all choices are resolved by probabilistic distributions. Acceptance of an infinite input word can be defined in different ways: by requiring…
We propose a new model of computation based on nonstandard analysis. Intuitively, the role of "algorithm" is played by a new notion of finite procedure, called Omega-invariance and inspired by physics, from nonstandard analysis. Moreover,…
It has been known for almost three decades that many $\mathrm{NP}$-hard optimization problems can be solved in polynomial time when restricted to structures of constant treewidth. In this work we provide the first extension of such results…
We obtain asymptotic formulas for the sums $\sum_{n_1,\ldots,n_k\le x} f((n_1,\ldots,n_k))$ and $ \sum_{n_1,\ldots,n_k\le x} f([n_1,\ldots,n_k])$ involving the gcd and lcm of the integers $n_1,\ldots,n_k$, where $f$ belongs to certain…
We prove that quantum computation is polynomially equivalent to classical probabilistic computation with an oracle for estimating the value of simple sums, quadratically signed weight enumerators. The problem of estimating these sums can be…