Sciweavers

8824 search results - page 38 / 1765
» On the Complexity of Real Functions
Sort
View
FUIN
2006
89views more  FUIN 2006»
13 years 8 months ago
Recursive Analysis Characterized as a Class of Real Recursive Functions
Recently, using a limit schema, we presented an analog and machine independent algebraic characterization of elementary functions over the real numbers in the sense of recursive a...
Olivier Bournez, Emmanuel Hainry
ICALP
2004
Springer
14 years 1 months 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
MOC
2002
109views more  MOC 2002»
13 years 8 months ago
The parallelized Pollard kangaroo method in real quadratic function fields
Abstract. We show how to use the parallelized kangaroo method for computing invariants in real quadratic function fields. Specifically, we show how to apply the kangaroo method to ...
Andreas Stein, Edlyn Teske
ITA
2007
104views Communications» more  ITA 2007»
13 years 8 months ago
Automata, Borel functions and real numbers in Pisot base
This note is about functions f : Aω → Bω whose graph is recognized by a B¨uchi finite automaton on the product alphabet A × B. These functions are Baire class 2 in the Bair...
Benoit Cagnard, Pierre Simonnet
CCA
2005
Springer
14 years 2 months ago
Effectively Open Real Functions
A function f is continuous iff the pre-image f −1[V ] of any open setV is open again. Dual to this topological7 property, f is called open iff the image f [U] of any open set U ...
Martin Ziegler