default search action
Xizhong Zheng
Person information
- affiliation: Arcadia University, Glenside, PA, USA
- affiliation (former): Jiangsu University, Department of Computer Science, Zhenjiang, China
- affiliation (former): Brandenburg University of Technology, Cottbus, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [c34]Klaus Ambos-Spies, Xizhong Zheng:
On the Differences and Sums of Strongly Computably Enumerable Real Numbers. CiE 2019: 310-322 - 2012
- [j28]Xizhong Zheng, Robert Rettinger:
Point-Separable Classes of Simple Computable Planar Curves. Log. Methods Comput. Sci. 8(3) (2012) - 2010
- [c33]Matthew S. Bauer, Xizhong Zheng:
On the Weak Computability of Continuous Real Functions. CCA 2010: 29-40 - [e1]Xizhong Zheng, Ning Zhong:
Proceedings Seventh International Conference on Computability and Complexity in Analysis, CCA 2010, Zhenjiang, China, 21-25th June 2010. EPTCS 24, 2010 [contents]
2000 – 2009
- 2009
- [c32]Robert Rettinger, Xizhong Zheng:
On the Computability of Rectifiable Simple Curve (Extended Abstract). CCA 2009 - [c31]Robert Rettinger, Xizhong Zheng:
Points on Computable Curves of Computable Lengths. MFCS 2009: 736-743 - 2008
- [j27]Xizhong Zheng:
A Hierarchy of Computably Enumerable Reals. Fundam. Informaticae 83(1-2): 219-230 (2008) - [j26]Xizhong Zheng:
Classification of Computably Approximable Real Numbers. Theory Comput. Syst. 43(3-4): 603-624 (2008) - 2007
- [j25]Xizhong Zheng:
On the hierarchies of $\Delta^0_2$-real numbers. RAIRO Theor. Informatics Appl. 41(1): 3-25 (2007) - [j24]Ker-I Ko, Klaus Weihrauch, Xizhong Zheng:
Editorial: Math. Log. Quart. 4-5/2007. Math. Log. Q. 53(4-5): 325 (2007) - [j23]Qingliang Chen, Kaile Su
, Xizhong Zheng:
Primitive recursive real numbers. Math. Log. Q. 53(4-5): 365-380 (2007) - [c30]Xizhong Zheng:
Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals. COCOON 2007: 327-337 - [c29]Xizhong Zheng:
Finitely Bounded Effective Computability. CCA 2007: 255-265 - 2006
- [j22]Robert Rettinger, Xizhong Zheng:
A hierarchy of Turing degrees of divergence bounded computable real numbers. J. Complex. 22(6): 818-826 (2006) - [j21]Kaile Su
Verification of Authentication Protocols for Epistemic Goals via SAT Compilation. J. Comput. Sci. Technol. 21(6): 932-943 (2006) - [j20]Xizhong Zheng, Robert Rettinger:
A Reference Correction of "Effective Jordan Decomposition". Theory Comput. Syst. 39(2): 385-385 (2006) - [j19]Xizhong Zheng, Dianchen Lu
Divergence bounded computable real numbers. Theor. Comput. Sci. 351(1): 27-38 (2006) - [c28]Xizhong Zheng:
A Computability Theory of Real Numbers. CiE 2006: 584-594 - [c27]Qingliang Chen, Kaile Su
Primitive Recursiveness of Real Numbers under Different Representations. CCA 2006: 303-324 - [c26]Xizhong Zheng:
Classification of the Computable Approximations by Divergence Boundings. CCA 2006: 325-344 - 2005
- [j18]Xizhong Zheng, Robert Rettinger, George Barmpalias
h-monotonically computable real numbers. Math. Log. Q. 51(2): 157-170 (2005) - [j17]Xizhong Zheng, Robert Rettinger:
Effective Jordan Decomposition. Theory Comput. Syst. 38(2): 189-209 (2005) - [j16]Xizhong Zheng, Robert Rettinger, Romain Gengler:
Closure Properties of Real Number Classes under CBV Functions. Theory Comput. Syst. 38(6): 701-729 (2005) - [c25]Robert Rettinger, Xizhong Zheng:
A Hierarchy of Turing Degrees for Divergence Bounded Computable Real Numbers. CCA 2005: 199-209 - [c24]Robert Rettinger, Xizhong Zheng:
On the Turing Degrees of Divergence Bounded Computable Reals. CiE 2005: 418-428 - [c23]Robert Rettinger, Xizhong Zheng:
Solovay Reducibility on D-c.e Real Numbers. COCOON 2005: 359-368 - 2004
- [j15]Rod Downey, Guohua Wu, Xizhong Zheng:
Degrees of d. c. e. reals. Math. Log. Q. 50(4-5): 345-350 (2004) - [j14]Xizhong Zheng, Robert Rettinger:
Weak computability and representation of reals. Math. Log. Q. 50(4-5): 431-442 (2004) - [c22]Xizhong Zheng, Robert Rettinger:
On the Extensions of Solovay-Reducibility.. COCOON 2004: 360-369 - [c21]Xizhong Zheng, Robert Rettinger:
A Note On the Turing Degrees of Divergence Bounded Computable Reals. CCA 2004: 231-237 - 2003
- [j13]Robert Rettinger, Xizhong Zheng:
On the hierarchy and extension of monotonically computable real numbers. J. Complex. 19(5): 672-691 (2003) - [j12]Xizhong Zheng:
On the Turing Degrees of Weakly Computable Real Numbers. J. Log. Comput. 13(2): 159-172 (2003) - [c20]Xizhong Zheng:
On the Divergence Bounded Computable Real Numbers. COCOON 2003: 102-111 - [c19]Xizhong Zheng, George Barmpalias
On the Monotonic Computability of Semi-computable Real Numbers. DMTCS 2003: 290-300 - [c18]Xizhong Zheng, Robert Rettinger, Romain Gengler:
Ershov's Hierarchy of Real Numbers. MFCS 2003: 681-690 - [c17]Xizhong Zheng, Robert Rettinger, Burchard von Braunmühl:
On the Effective Jordan Decomposability. STACS 2003: 167-178 - 2002
- [j11]Robert Rettinger, Xizhong Zheng, Romain Gengler, Burchard von Braunmühl:
Monotonically Computable Real Numbers. Math. Log. Q. 48(3): 459-479 (2002) - [j10]Xizhong Zheng:
Recursive Approximability of Real Numbers. Math. Log. Q. 48(S1): 131-156 (2002) - [j9]Xizhong Zheng:
The closure properties on real numbers under limits and computable operators. Theor. Comput. Sci. 284(2): 499-518 (2002) - [c16]Robert Rettinger, Xizhong Zheng:
Burchard von Braunmühl, Computable Real Functions of Bounded Variation and Semi-computable Real Numbers. COCOON 2002: 47-56 - [c15]Xizhong Zheng, Robert Rettinger, Burchard von Braunmühl:
Effectively Absolute Continuity and Effective Jordan Decomposability. CCA 2002: 213-224 - 2001
- [j8]Xizhong Zheng, Klaus Weihrauch:
The Arithmetical Hierarchy of Real Numbers. Math. Log. Q. 47(1): 51-65 (2001) - [c14]Robert Rettinger, Xizhong Zheng, Romain Gengler, Burchard von Braunmühl:
Weakly Computable Real Numbers and Total Computable Real Functions. COCOON 2001: 586-595 - [c13]Robert Rettinger, Xizhong Zheng, Romain Gengler, Burchard von Braunmühl:
Monotonically Computable Real Numbers. DMTCS 2001: 187-201 - [c12]Robert Rettinger, Xizhong Zheng:
Hierarchy of Monotonically Computable Real Numbers. MFCS 2001: 633-644 - 2000
- [j7]Klaus Ambos-Spies, Klaus Weihrauch, Xizhong Zheng:
Weakly Computable Real Numbers. J. Complex. 16(4): 676-690 (2000) - [j6]Klaus Weihrauch, Xizhong Zheng:
Computability on continuous, lower semi-continuous and upper semi-continuous real functions. Theor. Comput. Sci. 234(1-2): 109-133 (2000) - [c11]Xizhong Zheng:
Closure Properties of Real Number Classes under Limits and Computable Operators. COCOON 2000: 170-179
1990 – 1999
- 1999
- [j5]Vasco Brattka
Approaches to Effective Semi-Continuity of Real Functions. Math. Log. Q. 45: 481-496 (1999) - [j4]Klaus Weihrauch, Xizhong Zheng:
Effectiveness of the Global Modulus of Continuity on Metric Spaces. Theor. Comput. Sci. 219(1-2): 439-450 (1999) - [c10]Xizhong Zheng:
Binary Enumerability of Real Numbers. COCOON 1999: 300-309 - [c9]Xizhong Zheng, Klaus Weihrauch:
The Arithmetical Hierarchy of Real Numbers. MFCS 1999: 23-33 - 1998
- [c8]Vasco Brattka, Klaus Weihrauch, Xizhong Zheng:
Approaches to Effective Semi-continuity of Real Functions. COCOON 1998: 184-193 - [c7]Klaus Weihrauch, Xizhong Zheng:
A Finite Hierarchy of the Recursively Enumerable Real Numbers. MFCS 1998: 798-806 - 1997
- [j3]Klaus Ambos-Spies, Sebastiaan Terwijn, Xizhong Zheng:
Resource Bounded Randomness and Weakly Complete Problems. Theor. Comput. Sci. 172(1-2): 195-207 (1997) - [c6]Klaus Weihrauch, Xizhong Zheng:
Computability on Continuou, Lower Semi-continuous and Upper Semi-continuous Real Functions. COCOON 1997: 166-175 - [c5]Klaus Weihrauch, Xizhong Zheng:
Effectiveness of the Global Modulus of Continuity on Metric Spaces. Category Theory and Computer Science 1997: 210-219 - 1996
- [c4]Klaus Weihrauch, Xizhong Zheng:
Computability on Continuous, Lower Semi-Continuous and Upper Semi-Continuous Real Functions. CCA 1996 - [c3]Klaus Ambos-Spies, Elvira Mayordomo, Xizhong Zheng:
A Comparison of Weak Completeness Notions. CCC 1996: 171-178 - [c2]Klaus Ambos-Spies, Elvira Mayordomo, Yongge Wang
Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness. STACS 1996: 63-74 - 1994
- [j2]Xizhong Zheng:
The rhombus classes of degrees of unsolvability (I), The jump properties. Arch. Math. Log. 33(1): 1-12 (1994) - [c1]Klaus Ambos-Spies, Sebastiaan Terwijn, Xizhong Zheng:
Resource Bounded Randomness and Weakly Complete Problems. ISAAC 1994: 369-377 - 1993
- [j1]Xizhong Zheng:
On the Maximality of Some Pairs of p-t Degrees. Notre Dame J. Formal Log. 34(1): 29-35 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: