Home

Xizhong Zheng

  1. Proceedings Seventh International Conference on Computability and Complexity in Analysis.

    Fri, 06/04/2010 - 15:02 — SomNambul
    Authors: Xizhong Zheng, Ning Zhong
    Subjects: Computational Complexity
    Abstract

    This volume of the Electronic Proceedings in Theoretical Computer Science
    (EPTCS) contains extended abstracts of talks to be presented at the Seventh
    International Conference on Computability and Complexity in Analysis (CCA 2010)
    that will take place in Zhenjiang, China, June 21-25, 2010. This conference is
    the seventeenth event in the series of CCA annual meetings. The CCA conferences
    are aimed at promoting the study and advancement of the theory of computability
    and complexity over real-valued data and its application.

  2. On the Weak Computability of Continuous Real Functions.

    Thu, 06/03/2010 - 15:01 — SomNambul
    Authors: Matthew S. Bauer, Xizhong Zheng
    Subjects: Computational Complexity
    Abstract

    In computable analysis, sequences of rational numbers which effectively
    converge to a real number x are used as the (rho-) names of x. A real number x
    is computable if it has a computable name, and a real function f is computable
    if there is a Turing machine M which computes f in the sense that, M accepts
    any rho-name of x as input and outputs a rho-name of f(x) for any x in the
    domain of f.

Math-arch

Syndicate content