429 search results - page 10 / 86 » Turing computations on ordinals |
106
click to vote
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
In this paper, we propose an ordinal hyperplane ranking algorithm called OHRank, which estimates human ages via facial images. The design of the algorithm is based on the relative...
INFORMATICALT
2010
14 years 7 months ago
2010
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several ...
72
Voted
JIFS
2002
14 years 9 months ago
2002
A novel way to simulate Turing Machines (TMs) by Artificial Neural Networks (ANNs) is proposed. We claim that the proposed simulation is in agreement with the correct interpretatio...
78
Voted
FSS
2008
14 years 9 months ago
2008
We work with fuzzy Turing machines (FTMs) and we study the relationship between this computational model and classical recursion concepts such as computable functions, recursively...
CIE
2005
Springer
15 years 3 months ago
2005
Springer
The d-c.e. (difference of c.e.) and dbc (divergence bounded computable) reals are two important subclasses of ∆0 2-reals which have very interesting computability-theoretical as...