562 search results - page 19 / 113 » Concurrent Turing Machines |
107
click to vote
CIE
2005
Springer
15 years 5 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...
IJBC
2007
14 years 11 months ago
2007
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable...
191
click to vote
ICLP
2009
Springer
16 years 11 days ago
2009
Springer
In this paper, we study the modelization of biochemical reaction by using concurrent constraint programming idioms. In particular we will consider the stochastic concurrent constra...
101
click to vote
OOPSLA
2010
Springer
2010
Springer
Encapsulation and locality: a foundation for concurrency support in multi-language virtual machines?
14 years 9 months ago
We propose to search for common abstractions for different concurrency models to enable high-level language virtual machines to support a wide range of different concurrency model...
128
click to vote
ACSD
1998
IEEE
15 years 4 months ago
1998
IEEE
We implement a finite state machine (FSM) domain for specifying and simulating control functionality of a system within the Ptolemy software environment. The FSM domain is success...