16430 search results - page 101 / 3286 » On Computable Tree Functions |
121
click to vote
JC
2006
15 years 3 months ago
2006
We give a correspondence between two notions of complexity for real numbers and functions: poly-time computability according to Ko and a notion that arises naturally when one cons...
134
click to vote
JUCS
2007
15 years 3 months ago
2007
: We investigate the computational power of C++ compilers. In particular, it is known that any partial recursive function can be computed at compile time, using the template mechan...
127
click to vote
JUCS
2008
15 years 3 months ago
2008
: In the representation approach to computable analysis (TTE) [Grz55, i00], abstract data like rational numbers, real numbers, compact sets or continuous real functions are represe...
221
Voted
Book
"Libavl is a library in ANSI C for manipulation of various types of binary trees. This
book provides an introduction to binary tree techniques and presents all of Libavl’s ...
107
click to vote
TIT
2008
15 years 3 months ago
2008
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...