Ning Zhong

Affiliations:
  • University of Cincinnati, OH, USA


According to our database1, Ning Zhong authored at least 44 papers between 1997 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines.
Comput., 2023

2021
The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable.
Theor. Comput. Sci., 2021

Robustness of non-computability.
CoRR, 2021

Computing the exact number of periodic orbits for planar flows.
CoRR, 2021

Computability of Limit Sets for Two-Dimensional Flows.
Proceedings of the Connecting with Computability, 2021

2020
Computability of the Solutions to Navier-Stokes Equations via Effective Approximation.
Proceedings of the Complexity and Approximation - In Memory of Ker-I Ko, 2020

2018
Computability of Ordinary Differential Equations.
Proceedings of the Sailing Routes in the World of Computation, 2018

2017
Computing geometric Lorenz attractors with arbitrary precision.
CoRR, 2017

2015
Computability aspects for 1st-order partial differential equations via characteristics.
Theor. Comput. Sci., 2015

An analytic System with a Computable Hyperbolic Sink Whose Basin of Attraction is Non-Computable.
Theory Comput. Syst., 2015

A Tribute to Marian Boykan Pour-El (1928-2009).
J. Log. Comput., 2015

On Computability of Navier-Stokes' Equation.
Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014
On Effective Convergence of Numerical Solutions for Differential Equations.
ACM Trans. Comput. Theory, 2014

2013
Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
The connection between computability of a nonlinear problem and its linearization: The Hartman-Grobman theorem revisited.
Theor. Comput. Sci., 2012

Computability, noncomputability, and hyperbolic systems.
Appl. Math. Comput., 2012

2011
Computability in planar dynamical systems.
Nat. Comput., 2011

2009
Topological Complexity of Blowup Problems.
J. Univers. Comput. Sci., 2009

Computing Domains of Attraction for Planar Dynamics.
Proceedings of the Unconventional Computation, 8th International Conference, 2009

Computable Analysis of Differential Equations (Invited Talk).
Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009

2008
Editorial: Math. Log. Quart. 5/2008.
Math. Log. Q., 2008

Computability and Complexity in Analysis.
J. Univers. Comput. Sci., 2008

Complexity of Blowup Problems: Extended Abstract.
Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, 2008

2007
Computable Analysis of a Boundary-Value Problem for the Korteweg-de Vries Equation.
Theory Comput. Syst., 2007

Preface.
Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007

2006
Computing Schrödinger propagators on Type-2 Turing machines.
J. Complex., 2006

Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I).
Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

Beyond the First Main Theorem - When Is the Solution of a Linear Cauchy Problem Computable?
Proceedings of the Theory and Applications of Models of Computation, 2006

2005
Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing.
Theor. Comput. Sci., 2005

Computable Analysis of a Non-homogeneous Boundary-Value Problem for the Korteweg-de Vries Equation.
Proceedings of the New Computational Paradigms, 2005

2004
Preface: MLQ - Math. Log. Quart. 4-5/2004.
Math. Log. Q., 2004

An Algorithm for Computing Fundamental Solutions.
Proceedings of the 6th Workshop on Computability and Complexity in Analysis, 2004

2003
Computatbility theory of generalized functions.
J. ACM, 2003

2002
Preface: MLQ - Math. Log. Quart. Supplement 1/2002.
Math. Log. Q., 2002

The Solution Operator of the Korteweg-de Vries Equation is Computable.
Proceedings of the Computability and Complexity in Analysis, 2002

2001
Computability of Solutions of the Korteweg-de Vries Equation.
Math. Log. Q., 2001

Turing Computability of a Nonlinear Schrödinger Propagator.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000
Is the Linear Schrödinger Propagator Turing Computable?
Proceedings of the Computability and Complexity in Analysis, 4th International Workshop, 2000

1999
Computability Structure of the Sobolev Spaces and Its Applications.
Theor. Comput. Sci., 1999

<i>L<sup>p</sup></i>-Computability.
Math. Log. Q., 1999

The Wave Propagator Is Turing Computable.
Proceedings of the Automata, 1999

1998
Recursively Enumerable Subsets of R<sup>q</sup> in Two Computing Models: Blum-Shub-Smale Machine and Turing Machine.
Theor. Comput. Sci., 1998

Derivatives of Computable Functions.
Math. Log. Q., 1998

1997
The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable.
Math. Log. Q., 1997


  Loading...