Recursively enumerable subsets of R q in two computing models Blum-Shub-Smale machine and Turing machine

Author: Ning Z.  

Publisher: Elsevier

ISSN: 0304-3975

Source: Theoretical Computer Science, Vol.197, Iss.1, 1998-05, pp. : 79-94

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract