Complexity theory of real functions
Complexity theory of real functions
Computability with low-dimensional dynamical systems
Theoretical Computer Science
Reachability analysis of dynamical systems having piecewise-constant derivatives
Theoretical Computer Science - Special issue on hybrid systems
On the computational power of neural nets
Journal of Computer and System Sciences
Small universal Turing machines
Theoretical Computer Science - Special issue on universal machines and computations
Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy
Theoretical Computer Science - Special issue on real numbers and computers
Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
Theoretical Computer Science - Special issue on real numbers and computers
What's decidable about hybrid automata?
Journal of Computer and System Sciences
Computable analysis: an introduction
Computable analysis: an introduction
Introduction to the Theory of Computation: Preliminary Edition
Introduction to the Theory of Computation: Preliminary Edition
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Robust simulations of turing machines with analytic maps and flows
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Survey A survey of computational complexity results in systems and control
Automatica (Journal of IFAC)
| Hi-index | 0.00 |
Consider the initial-value problem with computable parameters{dxdt=p(t,x)x(t"0)=x"0, where p:R^n^+^1-R^n is a vector of polynomials and (t"0,x"0)@?R^n^+^1. We show that the problem of determining whether the maximal interval of definition of this initial-value problem is bounded or not is in general undecidable.