8512 search results - page 240 / 1703 » Computing Theory With Relevance |
134
Voted
ORDER
2007
15 years 4 months ago
2007
Abstract. We analyze results on well-partial-orderings from the viewpoint of computability theory, and we answer a question posed by Diana Schmidt. We obtain the following results....
164
click to vote
ALT
2003
Springer
16 years 2 months ago
2003
Springer
Solomonoff unified Occam’s razor and Epicurus’ principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field...
141
Voted
EUROCAST
2005
Springer
15 years 10 months ago
2005
Springer
In this paper a way to have structures with partiality in its internal structure in a categorical approach is presented and, with this, a category of partial graphs Grp is given an...
130
click to vote
DIGRA
2005
Springer
15 years 10 months ago
2005
Springer
Espen Aarseth recently claimed that all games referred to as ’narrative games’ could better be described as ’quest games’. The writer of this paper suggests that Max Payne...
163
Voted
FOSSACS
2005
Springer
15 years 10 months ago
2005
Springer
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...