TCS
2002
13 years 4 months ago
2002
TCS
2002
13 years 4 months ago
2002
We de ne an in nite array A of nonnegative integers based on a linear recurrence, whose second row provides basis elements of an exotic ternary numeration system. Using the numerat...
TCS
2002
13 years 4 months ago
2002
TCS
2002
13 years 4 months ago
2002
We study the relationship between a computably enumerable real and its presentations: ways of approximating the real by enumerating a prefix-free set of binary strings.
TCS
2002
13 years 4 months ago
2002
TCS
2002
13 years 4 months ago
2002
TCS
2002
13 years 4 months ago
2002
The chords' problem is a variant of an old problem of computational geometry: given a set of points of n , one can easily build the multiset of the distances between the poi...
TCS
2002
13 years 4 months ago
2002
TCS
2002
13 years 4 months ago
2002
In this paper we present two non-standard-type inference systems for conjunctive strictness and totality analyses of higher-order-typed functional programs and prove completeness ...
TCS
2002
13 years 4 months ago
2002
We investigate the problem of producing symmetric tilings by programs in a uniform way. By this, we mean that the construction of a tiling should be parameterized by the geometric...