Related papers: Effective completeness for real computation

This paper has been withdrawn by the author due to errors and bad formalization.

There is one, and only one way, consistent with fundamental physics, that the efficiency of general digital computation can continue increasing indefinitely, and that is to apply the principles of reversible computing. We need to begin…

This paper has been withdrawn by the authors. Because of a misunderstanding, the paper was submitted prematurely to the arXiv. A replacement will follow.

The initial remarks in this technical report are primarily for those not familiar with the properties of L1 approximation, but the remainder of the report should also interest readers who are already acquainted with the inner workings of L1…

This paper has been withdrawn by the authors. There was an erroneous estimate of the degree of a transformed polynomial, making the method appear more effective than it really is. We thank an anonymous referee for pointing out this error.

The paper has been withdrawn by the author due to unhappy mistake in the initial scope of the work.

It has been pointed out by counterexamples in a 2013 paper in the IEEE Transactions on Computers [1], that there is an error in the previously ibid.\ in 2005 published paper [2] on the construction of valid digit selection tables for SRT…

This paper has been withdrawn by the author due to a crucial error in equation (51).

It is known that the computation of the Voigt/complex error function is problematic for highly accurate and rapid computation at small imaginary argument $y << 1$, where $y = \operatorname{Im} \left[ z \right]$. In this paper we consider an…

The error function of real argument can be uniformly approximated to a given accuracy by a single closed-form expression for the whole variable range either in terms of addition, multiplication, division, and square root operations only, or…

The paper (as posted originally) contains several errors. It has been subsequently split into two papers, the corrected (and accepted for publication) versions appear in the archive as papers cs.CC/0503082 and cs.DM/0503083.

In this small note we correct an error made by Mohammadi et al. in their paper entitled "On Skew Cyclic Codes Over A Finite Ring" ( Iranian Jl. Math. Sci. Inform. Vol 14 (1) (2019), 135-145).

This paper has been withdrawn by the author due a few mistakes in the paper.

Although the results are correct, it was pointed out that the results follow from some previously known results. Accordingly, this version of the paper is withdrawn by the authors.

This paper has been withdrawn by the authors due to an error in the main theorem.

This paper has been withdrawn by the author due a crucial error.

Secure computation of equivalence has fundamental application in many different areas, including healthcare. We study this problem in the context of matching an individual identity to link medical records across systems. We develop an…

This paper has been withdrawn by the author due to some errors.

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…

This is the first in a series of three papers on Algebraic Set Theory. Its main purpose is to lay the necessary groundwork for the next two parts, one on Realisability and the other on Sheaf Models in Algebraic Set Theory.