429 search results - page 34 / 86 » Turing computations on ordinals |
ICNSC
2007
IEEE
15 years 6 months ago
2007
IEEE
— Today sending spams has turned to be a major problem in the Internet. It is so serious that more than 80% of the transferred emails are spams. As a result, various methods have...
NDJFL
2010
14 years 6 months ago
2010
Van Lambalgen's Theorem plays an important role in algorithmic randomness, especially when studying relative randomness. In this paper we extend van Lambalgen's Theorem ...
TCS
2010
14 years 6 months ago
2010
We describe a solution to the SAT problem via non-confluent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simula...
CIE
2010
Springer
15 years 4 months ago
2010
Springer
The notion of computability is stable (i.e. independent of the choice of an indexing) over infinite-dimensional vector spaces provided they have a finite “tensorial dimension...
101
click to vote
BIRTHDAY
2010
Springer
15 years 27 days ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...