429 search results - page 40 / 86 » Turing computations on ordinals |
APAL
1998
14 years 11 months ago
1998
We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under ...
AML
2008
14 years 12 months ago
2008
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
ENTCS
2007
14 years 11 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Most research into hypercomputation focuses only on machines able to prove stronger results the basic Turing Machine, hence the phrase hypercomputation. However, developing hyperco...
Publication
We propose a methodology for anonymization of records by aggregating sequential records. This methodology is applied to real valued, binary, nominal and ordinal data. We propose tw...