Xizhong Zheng

Professor, Computer Science and Mathematics

Boyer 112A 1 (267) 620-4803

About Me

I spent ten years in Chinese universities studying mathematics, four years at Jiangsu university for a BS degree, and six years at Nanjing university for MS and Ph.D degrees. Then I worked at Nanjing University for five years, before I went to Heidelberg University, Germany.

I pursued my second Ph.D in computer science in Hagen University, Germany. Then I worked in Hagen University and Cottbus University before I moved again to US. I was in University of Cincinnati as a visiting professor for one year, and then come to Arcadia University as a full time faculty member in the Department of Computer Science and Mathematics.

My main research area is the Computability and Complexity in Analysis (CCA) which tries to bridge the solid theoretical foundation of mathematics with the computational practices in computer science. 

Areas Of Focus

Computability and Computational Complexity, Mathematical Logic


Home Country

English, German, Chinese

Education History

Nanjing University, China 1987

PhD, Major in Mathematics

Hagen University, Germany 1998

PhD, Major in Computer Science

BTU Cottbus, Germany 2005

Habilitation, Major in Computer Science



Computability of Real Numbers

Contribution to book, a chapter of the "Handbook on Computability and Complexity in Analysis", Springer

Co-Authored with R. Rettinger

Author 2007

Effective Hierarchy of Real Numbers

Book, Shaker Verlag, Aachen

Co-author 2012

On the Forced Retracing Computable Curves

Research Paper, Studies in Logic, Vol. 5 (2012), No. 5, 1–10

Co-Authored with D. Abdul-Malak and M. Gillespie

Co-author 2012

Point-Separable Classes of Simple Computable Planar Curves

Research Paper, Logical Methods in Computer Science. Vol.8(3:15, 2012), 1-19

Co-Authored with R. Rettinger

Author 2008

Classification of computably approximable real numbers

Research Paper, Theory of Computing Systems Vol. 43(2008), No. 3-4, 603-624