Sciweavers

306 search results - page 4 / 62
» Constructive analysis, types and exact real numbers
Sort
View
ICALP
2004
Springer
14 years 26 days ago
An Analog Characterization of Elementarily Computable Functions over the Real Numbers
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...
Olivier Bournez, Emmanuel Hainry
COLT
1993
Springer
13 years 11 months ago
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
Paul W. Goldberg, Mark Jerrum
CSL
2005
Springer
14 years 1 months ago
Complexity and Intensionality in a Type-1 Framework for Computable Analysis
Implementations of real number computations have largely been unusable in practice because of their very bad performance, especially in comparison to floating point arithmetic imp...
Branimir Lambov
EJC
2007
13 years 7 months ago
On the number of matchings of a tree
In a paper of Klazar, several counting examples for rooted plane trees were given, including matchings and maximal matchings. Apart from asymptotical analysis, it was shown how to...
Stephan G. Wagner
ICFP
1999
ACM
13 years 11 months ago
Type Dispatch for Named Hierarchical Types
Type dispatch constructs are an important feature of many programming languages. Scheme has predicates for testing the runtime type of a value. Java has a class cast expression an...
Neal Glew