Related papers: Effective completeness for real computation

This submission is being withdrawn due to serious errors in the achievability proofs. The reviewers of the journal I had submitted to had found errors back in 2006. I had forgotten about this paper until I saw the CFP for a JSAC issue on…

The paper was withdrawn by the author. It contained various errors.

This paper has been withdrawn due to a critical error discovered in Theorem 4.21. Anyone with a historical or pragamatic interest in prior "negative results", however - e.g., failed proof attempts relating to the (in)consistency of ZF or…

The authors have decided to withdraw this submission. Clarifications/corrections, if any, may follow at a later date.

This paper has been withdrawn by the authors due to a fatal flaw in the central proof.

This paper has been withdrawn by the author due to a crucial sign error in equation 1.

This results in this paper have been merged with the result in arXiv:1003.0167. The authors would like to withdraw this version. Please see arXiv:1008.5356 for the merged version.

In this note, we show the mistake which has been made in quant-ph/0609176. Further more, we provide a sketch of proof to show the impossibility of the effort of such kind toward improving the efficiency of Grover's Algorithm.

This paper has been withdrawn by the author due to serious error found in main argument.

This paper has been withdrawn by the authors due to some fatal errors in the analysis.

We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices. By "accurate" we mean that the computed…

Completion is one of the most studied techniques in term rewriting and fundamental to automated reasoning with equalities. In this paper we present new correctness proofs of abstract completion, both for finite and infinite runs. For the…

In this paper, we present a generalized effective completeness theorem for continuous logic. The primary result is that any continuous theory is satisfied in a structure which admits a presentation of the same Turing degree. It then follows…

The paper has been withdrawn by the author, due to it being fundamentally flawed. The author apologizes for any inconvenience it may have caused.

In this essay we'll prove G\"odel's incompleteness theorems twice. First, we'll prove them the good old-fashioned way. Then we'll repeat the feat in the setting of computation. In the process we'll discover that G\"odel's work, rightly…

We give an example to show that the main result of [1] is incorrect.

This results in this paper have been merged with the result in arXiv:1002.3763v1 The authors would like to withdraw this version. Please see arXiv:1008.5356v1 for the merged version.

This paper presents a generalized flux-corrected transport (FCT) algorithm, which is shown to be total variation diminishing under some conditions. The new algorithm has improved properties from the standpoint of use and analysis. Results…

This paper has been withdrawn due to an error, and no further revisions will be made.

A very short note, explaining the error in the original paper, which renders its central result incorrect.