scientific article; zbMATH DE number 3183995

Cited in

(28)

Helena Rasiowa (1917–1994)
When series of computable functions with varying domains are computable
Contribution of Warsaw logicians to computational logic
Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
A Banach-Mazur computable but not Markov computable function on the computable real numbers
A sequentially computable function that is not effectively continuous at any point
Computable Carathéodory theory
Helena Rasiowa (1917-1994) Life and Personality
Computability on subsets of metric spaces.
Markov's constructive analysis; a participant's view
Generalized Banach-Mazur functionals in the topos of recursive sets
Computing the exact number of periodic orbits for planar flows
Theses for computation and recursion on concrete and abstract structures
Effective content of the calculus of variations. I: Semi-continuity and the chattering lemma
Non computable Mandelbrot-like sets for a one-parameter complex family
Computable Geometric Complex Analysis and Complex Dynamics
Hypercomputation by definition
Non-computable impressions of computable external rays of quadratic polynomials
Non-recursiveness of the operations on real numbers
Non-computable Julia sets
Towards understanding the theoretical challenges of numerical modeling of dynamical systems
Computable analysis with applications to dynamic systems
Computability of Brolin-Lyubich measure
Computability, noncomputability and undecidability of maximal intervals of IVPs
A domain-theoretic approach to computability on the real line
Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I
Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II
Computational unsolvability of domains of attraction of nonlinear systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5720193)