# Xizhong Zheng

According to our database

Collaborative distances:

^{1}, Xizhong Zheng authored at least 57 papers between 1993 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepages:

#### On csauthors.net:

## Bibliography

2019

On the Differences and Sums of Strongly Computably Enumerable Real Numbers.

Proceedings of the Computing with Foresight and Industry, 2019

2012

Point-Separable Classes of Simple Computable Planar Curves

Logical Methods in Computer Science, 2012

2010

On the Weak Computability of Continuous Real Functions

Proceedings of the Proceedings Seventh International Conference on Computability and Complexity in Analysis, 2010

2009

Points on Computable Curves of Computable Lengths.

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

On the Computability of Rectifiable Simple Curve (Extended Abstract).

Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009

2008

Classification of Computably Approximable Real Numbers.

Theory Comput. Syst., 2008

A Hierarchy of Computably Enumerable Reals.

Fundam. Inform., 2008

Finitely Bounded Effective Computability.

Electr. Notes Theor. Comput. Sci., 2008

2007

Editorial: Math. Log. Quart. 4-5/2007.

Math. Log. Q., 2007

Primitive recursive real numbers.

Math. Log. Q., 2007

On the hierarchies of $\Delta^0_2$-real numbers.

ITA, 2007

Classification of the Computable Approximations by Divergence Boundings.

Electr. Notes Theor. Comput. Sci., 2007

Primitive Recursiveness of Real Numbers under Different Representations.

Electr. Notes Theor. Comput. Sci., 2007

Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals.

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006

Divergence bounded computable real numbers.

Theor. Comput. Sci., 2006

A Reference Correction of "Effective Jordan Decomposition".

Theory Comput. Syst., 2006

Verification of Authentication Protocols for Epistemic Goals via SAT Compilation.

J. Comput. Sci. Technol., 2006

A hierarchy of Turing degrees of divergence bounded computable real numbers.

J. Complexity, 2006

A Computability Theory of Real Numbers.

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

Closure Properties of Real Number Classes under CBV Functions.

Theory Comput. Syst., 2005

Effective Jordan Decomposition.

Theory Comput. Syst., 2005

*h*-monotonically computable real numbers.

Math. Log. Q., 2005

A Note On the Turing Degrees of Divergence Bounded Computable Reals.

Electr. Notes Theor. Comput. Sci., 2005

Solovay Reducibility on D-c.e Real Numbers.

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

On the Turing Degrees of Divergence Bounded Computable Reals.

Proceedings of the New Computational Paradigms, 2005

A Hierarchy of Turing Degrees for Divergence Bounded Computable Real Numbers.

Proceedings of the CCA 2005, 2005

2004

Weak computability and representation of reals.

Math. Log. Q., 2004

Degrees of d. c. e. reals.

Math. Log. Q., 2004

On the Extensions of Solovay-Reducibility..

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

On the Turing Degrees of Weakly Computable Real Numbers.

J. Log. Comput., 2003

On the hierarchy and extension of monotonically computable real numbers.

J. Complexity, 2003

On the Effective Jordan Decomposability.

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Ershov's Hierarchy of Real Numbers.

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

On the Monotonic Computability of Semi-computable Real Numbers.

Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

On the Divergence Bounded Computable Real Numbers.

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002

The closure properties on real numbers under limits and computable operators.

Theor. Comput. Sci., 2002

Recursive Approximability of Real Numbers.

Math. Log. Q., 2002

Effectively Absolute Continuity and Effective Jordan Decomposability.

Electr. Notes Theor. Comput. Sci., 2002

Burchard von Braunmühl, Computable Real Functions of Bounded Variation and Semi-computable Real Numbers.

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001

Hierarchy of Monotonically Computable Real Numbers.

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Monotonically Computable Real Numbers.

Proceedings of the Combinatorics, 2001

Weakly Computable Real Numbers and Total Computable Real Functions.

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

Weakly Computable Real Numbers.

J. Complexity, 2000

Closure Properties of Real Number Classes under Limits and Computable Operators.

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999

Approaches to Effective Semi-Continuity of Real Functions.

Math. Log. Q., 1999

The Arithmetical Hierarchy of Real Numbers.

Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

Binary Enumerability of Real Numbers.

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998

A Finite Hierarchy of the Recursively Enumerable Real Numbers.

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Approaches to Effective Semi-continuity of Real Functions.

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

Effectiveness of the Global Modulus of Continuity on Metric Spaces.

Proceedings of the Category Theory and Computer Science, 7th International Conference, 1997

Computability on Continuou, Lower Semi-continuous and Upper Semi-continuous Real Functions.

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996

Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness.

Proceedings of the STACS 96, 1996

A Comparison of Weak Completeness Notions.

Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

Computability on Continuous, Lower Semi-Continuous and Upper Semi-Continuous Real Functions.

Proceedings of the Second Workshop on Computability and Complexity in Analysis, 1996

1994

The rhombus classes of degrees of unsolvability (I), The jump properties.

Arch. Math. Log., 1994

Resource Bounded Randomness and Weakly Complete Problems.

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993

On the Maximality of Some Pairs of p-t Degrees.

Notre Dame Journal of Formal Logic, 1993