Abstract computability and algebraic specification
ACM Transactions on Computational Logic (TOCL)
Quantified constraints under perturbation
Journal of Symbolic Computation
Theoretical Computer Science
Topological properties of real number representations
Theoretical Computer Science
Effectively closed sets and graphs of computable real functions
Theoretical Computer Science
Real number computation through gray code embedding
Theoretical Computer Science
The closure properties on real numbers under limits and computable operators
Theoretical Computer Science
Theoretical Computer Science
Real computations with fake numbers
Journal of Complexity
An analog characterization of the Grzegorczyk hierarchy
Journal of Complexity
Hierarchy of Monotonically Computable Real Numbers
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Computable Versions of Baire's Category Theorem
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
A Banach-Mazur Computable But Not Markov Computable Function on the Computable Real Numbers
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Random Numbers and an Incomplete Immune Recursive Set
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Hybrid Treatment of Evolutionary Sets
MICAI '02 Proceedings of the Second Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
On the Effective Jordan Decomposability
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A Tour with Constructive Real Numbers
TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
The Inversion Problem for Computable Linear Operators
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Closure Properties of Real Number Classes under Limits and Computable Operators
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Weakly Computable Real Numbers and Total Computable Real Functions
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Turing Computability of a Nonlinear Schrödinger Propagator
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Generalised Computability and Applications to Hybrid Systems
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Computing the Dimension of Linear Subspaces
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
On Computable Metric Spaces Tietze-Urysohn Extension Is Computable
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Computational Dimension of Topological Spaces
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Computabilities of Fine-Continuous Functions
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
The Degree of Unsolvability of a Real Number
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
A Survey of Exact Arithmetic Implementations
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Is the Linear Schrödinger Propagator Turing Computable?
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Admissible Representations of Limit Spaces
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Standard Representations of Effective Metric Spaces
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Effective Fixed Point Theorem over a Non-computably Separable Metric Space
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Semantic Characterisations of Second-Order Computability over the Real Numbers
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
On the Computational Power of a Continuous-Space Optical Model of Computation
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Random elements in effective topological spaces with measure
Information and Computation
The computational complexity of some julia sets
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Computability theory of generalized functions
Journal of the ACM (JACM)
Theoretical Computer Science - Topology in computer science
Computability on subsets of metric spaces
Theoretical Computer Science - Topology in computer science
A constructive theory of point-set nearness
Theoretical Computer Science - Topology in computer science
On the hierarchy and extension of monotonically computable real numbers
Journal of Complexity
Topological and limit-space subcategories of countably-based equilogical spaces
Mathematical Structures in Computer Science
Convergent approximate solving of first-order constraints by approximate quantifiers
ACM Transactions on Computational Logic (TOCL)
Hierarchies of total functionals over the reals
Theoretical Computer Science - Logic, semantics and theory of programming
Abstract versus concrete computation on metric partial algebras
ACM Transactions on Computational Logic (TOCL)
Domain theory and differential calculus (functions of one variable)
Mathematical Structures in Computer Science
Compact metric spaces as minimal-limit sets in domains of bottomed sequences
Mathematical Structures in Computer Science
Computability in linear algebra
Theoretical Computer Science
Computability versus exact computability of martingales
Information Processing Letters
Shortest path amidst disc obstacles is computable
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
An optical model of computation
Theoretical Computer Science
The computational complexity of distance functions of two-dimensional domains
Theoretical Computer Science
On the Complexity of Real Functions
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
P = NP for some structures over the binary words
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Elementarily computable functions over the real numbers and R-sub-recursive functions
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Compactly generated domain theory
Mathematical Structures in Computer Science
The P ≠ NP conjecture in the context of real and complex analysis
Journal of Complexity
Three concepts of decidability for general subsets of uncountable spaces
Theoretical Computer Science - Real numbers and computers
Stability versus speed in a computable algebraic model
Theoretical Computer Science - Real numbers and computers
Divergence bounded computable real numbers
Theoretical Computer Science - Real numbers and computers
A certified, corecursive implementation of exact real numbers
Theoretical Computer Science - Real numbers and computers
Theoretical Computer Science - Real numbers and computers
Effective real numbers in Mmxlib
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
On the computational content of the Lawson topology
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Languages and tools for hybrid systems design
Foundations and Trends in Electronic Design Automation
A computable version of the Daniell-Stone theorem on integration and linear functionals
Theoretical Computer Science
Uniform test of algorithmic randomness over a general space
Theoretical Computer Science
Continuity and computability of reachable sets
Theoretical Computer Science
Computing the solution of the Korteweg-de Vries equation with arbitrary precision on turing machines
Theoretical Computer Science
Representing probability measures using probabilistic processes
Journal of Complexity
Effectively open real functions
Journal of Complexity
Towards computability of elliptic boundary value problems in variational formulation
Journal of Complexity
Pre-apartness structures on spaces of functions
Journal of Complexity
Effective continuities on effective topological spaces
Journal of Complexity
The basic feasible functionals in computable analysis
Journal of Complexity
Computing Schrödinger propagators on Type-2 Turing machines
Journal of Complexity
Computability and the Implicit Function Theorem
Electronic Notes in Theoretical Computer Science (ENTCS)
Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I)
Electronic Notes in Theoretical Computer Science (ENTCS)
Admissible Representations of Probability Measures
Electronic Notes in Theoretical Computer Science (ENTCS)
Computing the Topological Entropy of Shifts
Electronic Notes in Theoretical Computer Science (ENTCS)
Computable Riesz Representation for the Dual of C [0;1]
Electronic Notes in Theoretical Computer Science (ENTCS)
Computability of Solutions of Operator Equations
Electronic Notes in Theoretical Computer Science (ENTCS)
Revising Type-2 Computation and Degrees of Discontinuity
Electronic Notes in Theoretical Computer Science (ENTCS)
Primitive Recursiveness of Real Numbers under Different Representations
Electronic Notes in Theoretical Computer Science (ENTCS)
Classification of the Computable Approximations by Divergence Boundings
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Jordan Curves with Polynomial Inverse Moduli of Continuity
Electronic Notes in Theoretical Computer Science (ENTCS)
Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
Theoretical Computer Science
Computability of analog networks
Theoretical Computer Science
Towards a descriptive set theory for domain-like structures
Theoretical Computer Science - Spatial representation: Discrete vs. continous computational models
A Convenient Category of Domains
Electronic Notes in Theoretical Computer Science (ENTCS)
RealLib: An efficient implementation of exact real arithmetic
Mathematical Structures in Computer Science
Constructive analysis, types and exact real numbers
Mathematical Structures in Computer Science
Two preservation results for countable products of sequential spaces
Mathematical Structures in Computer Science
Recursive Analysis Characterized as a Class of Real Recursive Functions
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Decidability and Universality in Symbolic Dynamical Systems
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Semantics of a sequential language for exact real-number computation
Theoretical Computer Science
Constructing non-computable Julia sets
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Engineering and theoretical underpinnings of retrenchment
Science of Computer Programming
The Kolmogorov complexity of infinite words
Theoretical Computer Science
On the computing power of fuzzy Turing machines
Fuzzy Sets and Systems
Computable Riesz Representation for Locally Compact Hausdorff Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Convergence of Fourier Series of Computable Lebesgue Integrable Functions
Electronic Notes in Theoretical Computer Science (ENTCS)
Uniformly Computable Aspects of Inner Functions
Electronic Notes in Theoretical Computer Science (ENTCS)
E2 -computability of e, π and Other Famous Constants
Electronic Notes in Theoretical Computer Science (ENTCS)
Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs
Electronic Notes in Theoretical Computer Science (ENTCS)
Singular Coverings and Non-Uniform Notions of Closed Set Computability
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Complexity of Operators on Compact Sets
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane
Electronic Notes in Theoretical Computer Science (ENTCS)
Notions of Probabilistic Computability on Represented Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Sequential Real Number Computation and Recursive Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
Computing the Solution of the m-Korteweg-de Vries Equation on Turing Machines
Electronic Notes in Theoretical Computer Science (ENTCS)
Effectivity on Continuous Functions in Topological Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Relationship between Filter Spaces and Weak Limit Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Computability of Blochs Constant
Electronic Notes in Theoretical Computer Science (ENTCS)
Computability of the Spectrum of Self-Adjoint Operators and the Computable Operational Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Implementing Real Numbers With RZ
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Computability and the morphological complexity of some dynamics on continuous domains
Theoretical Computer Science
Randomness with Respect to the Signed-Digit Representation
Fundamenta Informaticae
Computability Theoretic Properties of the Entropy of Gap Shifts
Fundamenta Informaticae
A Hierarchy of Computably Enumerable Reals
Fundamenta Informaticae
Are unbounded linear operators computable on the average for Gaussian measures?
Journal of Complexity
Fine hierarchies and m-reducibilities in theoretical computer science
Theoretical Computer Science
RZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Borel Complexity of Topological Operations on Computable Metric Spaces
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Effective Computation for Nonlinear Systems
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Algebraic Model of an Arithmetic Unit for TTE-Computable Normalized Rational Numbers
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
A Continuous Derivative for Real-Valued Functions
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Unique Existence and Computability in Constructive Reverse Mathematics
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
The Uniformity Principle for Σ-Definability with Applications to Computable Analysis
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
(Short) Survey of Real Hypercomputation
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Programming Experimental Procedures for Newtonian Kinematic Machines
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Internal Density Theorems for Hierarchies of Continuous Functionals
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Reliable Implementation of Real Number Algorithms: Theory and Practice
Theory of Real Computation According to EGC
Reliable Implementation of Real Number Algorithms: Theory and Practice
Dimensions of Points in Self-similar Fractals
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Topological Properties of Concept Spaces
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
The computable kernel of Abstract State Machines
Theoretical Computer Science
Computability of the Metric Projection Onto Finite-dimensional Linear Subspaces
Electronic Notes in Theoretical Computer Science (ENTCS)
How Incomputable is the Separable Hahn-Banach Theorem?
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards Computability over Effectively Enumerable Topological Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
An Effective Tietze-Urysohn Theorem for QCB-Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Computing Solutions of Symmetric Hyperbolic Systems of PDE's
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Difference Hierarchy in Countably Based T0-Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Continuity of Effective Multifunctions
Electronic Notes in Theoretical Computer Science (ENTCS)
On Finite-time Computability Preserving Conversions
Electronic Notes in Theoretical Computer Science (ENTCS)
Stability for Effective Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Effective Existence of Schauder Bases
Electronic Notes in Theoretical Computer Science (ENTCS)
Characterizing Computable Analysis with Differential Equations
Electronic Notes in Theoretical Computer Science (ENTCS)
Computability and Representations of the Zero Set
Electronic Notes in Theoretical Computer Science (ENTCS)
The complexity of simulating Brownian Motion
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Average-Price-per-Reward Games on Hybrid Automata with Strong Resets
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Fixed Point Theorems on Partial Randomness
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
ACM Transactions on Computational Logic (TOCL)
Operational domain theory and topology of sequential programming languages
Information and Computation
Reducibility of domain representations and cantor–weihrauch domain representations
Mathematical Structures in Computer Science
Absolutely non-computable predicates and functions in analysis†
Mathematical Structures in Computer Science
On computably locally compact hausdorff spaces
Mathematical Structures in Computer Science
A computable approach to measure and integration theory
Information and Computation
A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties
Theoretical Computer Science
Computability of probability measures and Martin-Löf randomness over metric spaces
Information and Computation
Applications of Effective Probability Theory to Martin-Löf Randomness
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
First-Order Universality for Real Programs
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Computability of Continuous Solutions of Higher-Type Equations
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Computable Exchangeable Sequences Have Computable de Finetti Measures
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Computability of Analytic Functions with Analytic Machines
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
An Application of Martin-Löf Randomness to Effective Probability Theory
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Abstract Geometrical Computation and Computable Analysis
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Computing Domains of Attraction for Planar Dynamics
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Abstract geometrical computation 3: black holes for classical and analog computing
Natural Computing: an international journal
Computable CTL* for Discrete-Time and Continuous-Space Dynamic Systems
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
The sequential topology on is not regular
Mathematical Structures in Computer Science
The dedekind reals in abstract stone duality
Mathematical Structures in Computer Science
ε-Topological formulation of tolerant solid modeling
Computer-Aided Design
Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
Information and Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Lazy Algorithms for Exact Real Arithmetic
Electronic Notes in Theoretical Computer Science (ENTCS)
An Algorithm for Computing Fundamental Solutions
Electronic Notes in Theoretical Computer Science (ENTCS)
A Computable Version of the Daniell-Stone Theorem on Integration and Linear Functionals
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Borel Complexity of Hahn-Banach Extensions
Electronic Notes in Theoretical Computer Science (ENTCS)
Hyperbolic Julia Sets are Poly-Time Computable
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Complexity of Finding Paths in a Two-Dimensional Domain II: Piecewise Straight-Line Paths
Electronic Notes in Theoretical Computer Science (ENTCS)
Hierarchies of Function Classes Defined by the First-Value Operator
Electronic Notes in Theoretical Computer Science (ENTCS)
Effective Dini's Theorem on Effectively Compact Metric Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Type-2 Computability and Moore's Recursive Functions
Electronic Notes in Theoretical Computer Science (ENTCS)
Some Examples of Non-Metrizable Spaces Allowing a Simple Type-2 Complexity Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Variations on Wadge Reducibility Extended Abstract
Electronic Notes in Theoretical Computer Science (ENTCS)
Domain Theoretic Solutions of Initial Value Problems for Unbounded Vector Fields
Electronic Notes in Theoretical Computer Science (ENTCS)
Computability versus exact computability of martingales
Information Processing Letters
P=NP for some structures over the binary words
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
The P≠NP conjecture in the context of real and complex analysis
Journal of Complexity
Topological properties of concept spaces (full version)
Information and Computation
Computability on subsets of locally compact spaces
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Efficient exact arithmetic over constructive reals
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Absolutely non-effective predicates and functions in computable analysis
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Using approximation to relate computational classes over the reals
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
DBPL'07 Proceedings of the 11th international conference on Database programming languages
The church-turing thesis over arbitrary domains
Pillars of computer science
Complexity theory for operators in analysis
Proceedings of the forty-second ACM symposium on Theory of computing
Using the witness method to detect rigid subsystems of geometric constraints in CAD
Proceedings of the 14th ACM Symposium on Solid and Physical Modeling
Domain representations of spaces of compact subsets
Mathematical Structures in Computer Science
Computability of countable subshifts
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Undecidability in Weihrauch degrees
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
Robust computations with dynamical systems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Polynomial time computation in the context of recursive analysis
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
Exact exploration and hanging algorithms
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Learning figures with the hausdorff metric by fractals
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Semantical proofs of correctness for programs performing non-deterministic tests on real numbers
Mathematical Structures in Computer Science
Cellular Automata, Decidability and Phasespace
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Information and Computation
A characterization of computable analysis on unbounded domains using differential equations
Information and Computation
Geometrical accumulations and computably enumerable real numbers
UC'11 Proceedings of the 10th international conference on Unconventional computation
Solving analytic differential equations in polynomial time over unbounded domains
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Satisfiability of systems of equations of real analytic functions is quasi-decidable
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
The minimum code length for clustering using the gray code
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part III
On the Kolmogorov complexity of continuous real functions
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Complexity issues for preorders on finite labeled forests
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Randomness and the ergodic decomposition
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Computability of the Radon-Nikodym derivative
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Multi-resolution cellular automata for real computation
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Semantics and Computability of the Evolution of Hybrid Systems
SIAM Journal on Control and Optimization
Noise vs computational intractability in dynamics
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Optical computing and computational complexity
UC'06 Proceedings of the 5th international conference on Unconventional Computation
The euclid abstract machine: trisection of the angle and the halting problem
UC'06 Proceedings of the 5th international conference on Unconventional Computation
Denotational semantics of hybrid automata
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
The role of algebraic models and type-2 theory of effectivity in special purpose processor design
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Turing universality in dynamical systems
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
An analysis of the lemmas of urysohn and urysohn-tietze according to effective borel measurability
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Coinductive proofs for basic real computation
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Optimization and approximation problems related to polynomial system solving
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Uncomputability below the real halting problem
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
A subrecursive refinement of the fundamental theorem of algebra
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Admissible representations in computable analysis
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
A computable version of dini's theorem for topological spaces
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On the complexity of computing the logarithm and square root functions on a complex domain
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Beyond the first main theorem – when is the solution of a linear cauchy problem computable?
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Prediction of recursive real-valued functions from finite examples
JSAI'05 Proceedings of the 2005 international conference on New Frontiers in Artificial Intelligence
Algebras as knowledge structures
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On beta-shifts having arithmetical languages
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Streams with a bottom in functional languages
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Computational universality in symbolic dynamical systems
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Real recursive functions and real extensions of recursive functions
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
A computational model for multi-variable differential calculus
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Complexity and intensionality in a type-1 framework for computable analysis
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Computing with sequences, weak topologies and the axiom of choice
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
A survey of recursive analysis and Moore's notion of real computation
Natural Computing: an international journal
ΣK-constraints for hybrid systems
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
How to compare the power of computational models
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Abstract geometrical computation: turing-computing ability and undecidability
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Computability in computational geometry
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Towards computability of higher type continuous data
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Formalising exact arithmetic in type theory
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
A network model of analogue computation over metric algebras
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Complexity of continuous space machine operations
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Computable analysis of a non-homogeneous boundary-value problem for the korteweg-de vries equation
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Computability and continuity on the real arithmetic hierarchy and the power of type-2 nondeterminism
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Classical computability and fuzzy turing machines
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Complexity Theory for Operators in Analysis
ACM Transactions on Computation Theory (TOCT)
Original article: Computational complexity of iterated maps on the interval
Mathematics and Computers in Simulation
The derivational complexity of string rewriting systems
Theoretical Computer Science
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Some steps into verification of exact real arithmetic
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
δ-complete decision procedures for satisfiability over the reals
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Delta-Decidability over the Reals
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Randomness with Respect to the Signed-Digit Representation
Fundamenta Informaticae
Computability Theoretic Properties of the Entropy of Gap Shifts
Fundamenta Informaticae
A Hierarchy of Computably Enumerable Reals
Fundamenta Informaticae
On the computational content of the brouwer fixed point theorem
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
A hierarchy of immunity and density for sets of reals
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Towards a theory of infinite time blum-shub-smale machines
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
What is turing's comparison between mechanism and writing worth?
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Compactness and the effectivity of uniformization
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Making solomonoff induction effective: or: you can learn what you can bound
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Computational complexity of smooth differential equations
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Recursive Analysis Characterized as a Class of Real Recursive Functions
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Decidability and Universality in Symbolic Dynamical Systems
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Automata theory based on complete residuated lattice-valued logic: Turing machines
Fuzzy Sets and Systems
Computability on random events and variables in a computable probability space
Theoretical Computer Science
Optimal abstraction on real-valued programs
SAS'07 Proceedings of the 14th international conference on Static Analysis
Real computational universality: the word problem for a class of groups with infinite presentation
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Bounded computable enumerability and hierarchy of computably enumerable reals
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Rational term rewriting revisited: decidability and confluence
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Abstract geometrical computation 7: geometrical accumulations and computably enumerable real numbers
Natural Computing: an international journal
A computational model for multi-variable differential calculus
Information and Computation
On the complexity of solving initial value problems
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
A language for differentiable functions
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Computation with perturbed dynamical systems
Journal of Computer and System Sciences
Computing with real numbers, from Archimedes to Turing and beyond
Communications of the ACM
Most Tensor Problems Are NP-Hard
Journal of the ACM (JACM)
A Stream Calculus of Bottomed Sequences for Real Number Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
On Effective Convergence of Numerical Solutions for Differential Equations
ACM Transactions on Computation Theory (TOCT)
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
On the Query Complexity of Real Functionals
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.04 |