429 search results - page 32 / 86 » Turing computations on ordinals |
TCS
2010
14 years 10 months ago
2010
We present some decidability and undecidability results for subsets of the BlenX Language, a process-calculi-based programming language developed for modelling biological processe...
108
click to vote
FOSSACS
2011
Springer
14 years 3 months ago
2011
Springer
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...
FSTTCS
2008
Springer
15 years 26 days ago
2008
Springer
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
— Due to the uncertainty in the forecasting of load patterns, security dispatching finds the generation pattern, which is the most economic and passes all N − 1 contingencies ...