258 search results - page 1 / 52 » Some Notes on Fine Computability |
JUCS
2002
13 years 7 months ago
2002
: A metric defined by Fine induces a topology on the unit interval which is strictly stronger than the ordinary Euclidean topology and which has some interesting applications in Wa...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
CIE
2007
Springer
14 years 1 months ago
2007
Springer
DAGSTUHL
2008
13 years 8 months ago
2008
Techniques of reliable computing, like interval arithmetic, can be used to guarantee reliable solutions even in the presence of numerical round-off errors. The need to trace bounds...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
We continue the study of the linear complexity of binary sequences, independently introduced by Sidel'nikov and Lempel, Cohn, and Eastman. These investigations were originated...