429 search results - page 4 / 86 » Turing computations on ordinals |
102
click to vote
SOFSEM
2012
Springer
13 years 5 months ago
2012
Springer
Abstract. Various methods exists in the literature for denoting the configuration of a Turing Machine. A key difference is whether the head position is indicated by some integer ...
94
Voted
CVPR
2012
IEEE
13 years 1 days ago
2012
IEEE
Automated facial expression recognition has received increased attention over the past two decades. Existing works in the field usually do not encode either the temporal evolutio...
103
Voted
MSCS
2010
14 years 8 months ago
2010
ABSTRACT. In this note we prove that any Turing machine which uses only a finite computational space for every input cannot solve an uncomputable problem even in case it runs in a...
APAL
1998
14 years 9 months ago
1998
A model is computable if its domain is a computable set and its relations and functions are uniformly computable. Let A be a computable model and let R be an extra relation on the ...
108
click to vote
LICS
2012
IEEE
13 years 13 hour ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...