2436 search results - page 29 / 488 » Comonadic Notions of Computation |
143
Voted
CIE
2005
Springer
15 years 9 months ago
2005
Springer
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...
106
Voted
JSYML
2010
15 years 2 months ago
2010
We extend the notion of limitwise monotonic functions to include arbitrary computable domains. We then study which sets and degrees are support increasing (support strictly increas...
89
Voted
ICPR
2000
IEEE
16 years 4 months ago
2000
IEEE
In a previous work, we defined a new approach to evaluating directional relations between objects (such as "is to the right of", "is above"...). The approach i...
122
Voted
CONPAR
1992
15 years 7 months ago
1992
A major feature of Computer Algebra, and more generally of non-numerical computations, is the dynamical and non-predictable behaviour of the executions. We then understand that st...
109
click to vote
ICMAS
2000
15 years 5 months ago
2000
In this paper, I motivate, define, and illustrate the notion of computationally grounded theories of agency. A theory of agency is said to be computationally grounded if we can gi...