Related papers: P^f is not equal to NP^f for almost all f
Extending results of Schindler [math.LO/0106087] and Hamkins and Welch [math.LO/0212046], we establish in the context of infinite time Turing machines that P is properly contained in NP intersect coNP. Furthermore, NP intersect coNP is…
We state a version of the P=?NP problem for infinite time Turing machines. It is observed that P not= NP for this version.
Schindler recently addressed two versions of the question P $\stackrel{?}{=}$ NP for Turing machines running in transfinite ordinal time. These versions differ in their definition of input length. The corresponding complexity classes are…
In this paper, we study the problem of controllability of Schr\"odinger equation. We prove that the system is exactly controllable in infinite time to any position. The proof is based on an inverse mapping theorem for multivalued functions.…
We prove that, assuming $\mathrm{ZF}$, and restricted to any pointed set, Chaitin's $\Omega_U:x\mapsto \Omega_U^x=\sum_{U^x(\sigma)\downarrow}2^{-|\sigma|}$ is not injective for any universal prefix-free Turing machine $U$, and that…
In this note, the main focus is on a question about transcendental entire functions mapping $\mathbb{Q}$ into $\mathbb{Q}$ (which is related to a Mahler's problem). In particular, we prove that, for any $t>0$, there is no a transcendental…
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…
Consider the solution of the time-dependent Schr{\"o}dinger equation with initial data $f$. It is shown in \cite{artikel} that there exists $f$ in the Sobolev space $H^s(\RR), s=n/2$ such that tangential convergence can not be widened to…
We investigate the continuous function $f$ defined by $$x\mapsto \sum_{\sigma\le_L x }2^{-K(\sigma)}$$ as a variant of Chaitin's Omega from the perspective of analysis, computability, and algorithmic randomness. Among other results, we…
In this paper, we establish the almost everywhere convergence of solutions to the Schr\"odinger operator with complex time $ P_{\gamma}f(x,t) $ in higher dimensions, under the assumption that the initial data $f$ belongs to the Sobolev…
Continuing the study of complexity theory of Koepke's Ordinal Turing Machines (OTMs) that was started by Rin, L\"owe and the author, we prove the following results: (1) An analogue of Ladner's theorem for OTMs holds: That is, there are…
Let f be a computable function from finite sequences of 0's and 1's to real numbers. We prove that strong f-randomness implies strong f-randomness relative to a PA-degree. We also prove: if X is strongly f-random and Turing reducible to Y…
We provide a new proof of ``most" cases of the polynomial Wiener-Wintner theorem for $\sigma$-finite spaces, using hard-analytic methods. Specifically, we prove that whenever $(X,\mu,T)$ is a $\sigma$-finite measure-preserving system, and…
This survey paper is based on a talk given at the 44th Summer Symposium in Real Analysis in Paris. This line of research was initiated by a question of Haight and Weizs\"aker concerning almost everywhere convergence properties of series of…
We present some simple counterexamples, based on quadratic forms in infinitely many variables, showing that the implication $f\in C^{(\infty}(\mathbb{T}^\omega)\Longrightarrow\sum_{\bar{p}\in\mathbb{Z}^\infty}|\widehat{f}(\bar{p})|<\infty$…
We study pointwise convergence of the solutions to Schr\"odinger equations with initial datum $f\in H^s(\mathbb R^n)$. The conjecture is that the solution $e^{it\Delta}f$ converges to $f$ almost everywhere for all $f\in H^s(\mathbb R^n)$ if…
We present an algorithm to invert the Euler function $\phi(m)$. The algorithm, for a given $n \geq 1$, in polynomial time ``on average'', finds the set $\Psi(n)$ of all solutions $m$ to $\phi(m) = n$. In fact, in the worst case, $\Psi(n)$…
SAT is not in P, is true and provable in a simply consistent extension B' of a first order theory B of computing, with a single finite axiom characterizing a universal Turing machine. Therefore, P is not equal to NP, is true and provable in…
For any function $f$ in $L^{\infty}(\mathbb{D})$, let $T_f$ denote the corresponding Toeplitz operator the Bergman space $A^2(\mathbb{D})$. A recent result of D. Luecking shows that if $T_f$ has finite rank then $f$ must be the zero…
In this paper, we show that the expansions of functions from $L^p$-Paley-Wiener type spaces in terms of the prolate spheroidal wave functions converge almost everywhere for $1<p<\infty$, even in the cases when they might not converge in…