Related papers: Effective completeness for real computation
This paper has been withdrawn, as all conjectures (and one claim) have been proven incorrect. Some of what remains may eventually reappear in a different context.
There is a serious flaw in the proposal [arXiv:1603.06857] for the achievement of unity efficiency in SPDC. This is a replacement due to mistakes in the table of probabilities. Numbers have been corrected.
This paper has been withdrawn by the author. This paper is now obsolete. For a solution please see: arXiv:/1205.4265.
This paper has been withdrawn by the authors; the main conclusion is incorrect, as some of the crucial calculations were not properly converged.
Some mistaken reasonings at the end of the paper omitted.
In this first of two papers, strong limits on the accuracy of physical computation are established. First it is proven that there cannot be a physical computer C to which one can pose any and all computational tasks concerning the physical…
In this work, we show that the proof of the main result in [An Application of Hayashi's Inequality for Differentiable Functions, Computers & Mathematics with Applications, 32 (6) (1996), 95--99, by R.P. Agarwal and S.S. Dragomir] was wrong.…
This paper has been withdrawn by the author, due an error in claim 1.
This paper has been withdrawn due to a crucial theoretical error.
This paper has been withdrawn. See v1 still available to understand the problem: Proposition 2.2 is false. The error in the proof is in claim (3). Then, the whole paper collapses. We do not have any correction for now. We apologize to…
We present an efficient multi-accuracy algorithm for the computations of a set of special functions of a complex argument, z=x+iy. These functions include the complex probability function w(z), and closely related functions such as the…
This paper has been withdrawn by the author due to the presented idea is wrong.
We give a concise overview of arxiv:0812.2519 and arxiv:1412.3248. The paper contains all the main results and constructions but no proofs.
This paper is withdrawn. See quant-ph/9806031 for a discussion.
This paper has been withdrawn by the author due to a error in attachment of source file.
This submission has been withdrawn by arXiv admins due to fraudulent affiliation claims by the original submitter.
Recently, various natural algorithmic problems have been shown to be $\exists \mathbb{R}$-complete. The reduction relied in many cases on the $\exists \mathbb{R}$-completeness of the problem ETR-INV, which served as a useful intermediate…
The original version of this paper contains an error; when this is corrected the basic conclusion changes. A revised manuscript will be submitted shortly.
The original proof of the Sharkovsky theorem is presented in full detail. The proof should be accessible to readers with basic Real Analysis background. Although nowadays there are several alternative proofs of this classical result, we…
This paper has been withdrawn by the author, due to an error in Proposition 2.2.