Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Korovina, Margarita - Department of Computer Science, Aarhus Universitet
An Upper Bound on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems Margarita Korovina
Pfaffian Hybrid Systems Margarita Korovina1
Gandy's Theorem for Abstract Structures without the Equality Test
Semantic Characterisations of Secondorder Computability Over the Real Numbers #
Some properties of majorantcomputability M.V.Korovina # O.V.Kudinov +
Generalised Computability of Operators and RealValued Functionals with Application to
Characteristic Properties of MajorantComputability over the Reals ?
Recent Advances in #definability over Continuous Data Types #
Computational Aspects of #definability over the Real Numbers without the Equality Test #
Electronic Notes in Theoretical Computer Science 66 No. 1 (2002) URL: http://www.elsevier.nl/locate/entcs/volume66.html 9 pages
MAJORANTCOMPUTABILITY AND DEFINABILITY OVER THE REALS
Formalisation of Computability of Operators and RealValued Functionals via Domain Theory #
Towards Computability of Higher Type Continuous Data
