429 search results - page 23 / 86 » Turing computations on ordinals |
68
Voted
CIE
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Effective domain theory is applied to fuzzy logic to give suitable notions of semi-decidable and decidable L-subset. The connection with the notions of fuzzy Turing machi...
104
click to vote
FUZZIEEE
2007
IEEE
15 years 1 months ago
2007
IEEE
An ordinal fuzzy linguistic Information Retrieval System (IRS) based on a multi-level weighting scheme to represent the user queries, in a more flexible way, is proposed. The IRS a...
CSR
2010
Springer
15 years 1 months ago
2010
Springer
We study one-head machines through symbolic and topological dynamics. In particular, a subshift is associated to the subshift, and we are interested in its complexity in terms of r...
STACS
1999
Springer
15 years 1 months ago
1999
Springer
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of str...
CIE
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we show that closed-form analytic maps and flows can simulate Turing machines in an error-robust manner. The maps and ODEs defining the flows are explicitly obtai...