Sciweavers

16430 search results - page 104 / 3286
» On Computable Tree Functions
Sort
View
ICALP
2004
Springer
15 years 11 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
ANTS
1998
Springer
112views Algorithms» more  ANTS 1998»
15 years 10 months ago
Unit Computation in Purely Cubic Function Fields of Unit Rank 1
Abstract. This paper describes a method for computing the fundamental unit and regulator of a purely cubic congruence function field of unit
Renate Scheidler, Andreas Stein
TPHOL
1996
IEEE
15 years 10 months ago
Synthetic Domain Theory in Type Theory: Another Logic of Computable Functions
We will present a Logic of Computable Functions based on the idea of Synthetic Domain Theory such that all functions are automatically continuous. Its implementation in the Lego pr...
Bernhard Reus
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
15 years 6 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka
CIG
2005
IEEE
15 years 12 months ago
Adapting Reinforcement Learning for Computer Games: Using Group Utility Functions
AbstractGroup utility functions are an extension of the common team utility function for providing multiple agents with a common reinforcement learning signal for learning cooperat...
Jay Bradley, Gillian Hayes