Complexity Theory Meets Ordinary Differential Equations

This publication has 37 references indexed in Scilit:

• Computability of the Solutions to Navier-Stokes Equations via Effective Approximation
  Lecture Notes in Computer Science, 2020
• Computational benefit of smoothness: Parameterized bit-complexity of numerical operators on analytic functions and Gevrey’s hierarchy
  Journal of Complexity, 2015
• Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
  Electronic Notes in Theoretical Computer Science, 2008
• Is the Linear Schrödinger Propagator Turing Computable?
  Lecture Notes in Computer Science, 2001
• Computable Analysis
  2000
• Networks of spiking neurons: The third generation of neural network models
  Neural Networks, 1997
• The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable
  Mathematical Logic Quarterly, 1997
• The computational complexity of maximization and integration
  Advances in Mathematics, 1984
• Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators
  Advances in Mathematics, 1983
• Computational complexity of real functions
  Theoretical Computer Science, 1982