Sciweavers

2333 search results - page 124 / 467
» Recursive Computational Depth
Sort
View
SFP
2003
13 years 11 months ago
FSM-Hume is finite state
Abstract Hume is a domain-specific programming language targeting resourcebounded computations. It is based on generalised concurrent bounded automata, controlled by transitions c...
Greg Michaelson, Kevin Hammond, Jocelyn Sér...
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
13 years 9 months ago
A Few More Cyclic Steiner 2-Designs
In this paper, we prove the existence of a cyclic (v, 4, 1)-BIBD for v = 12t + 4, 3 t 50 using computer programs, which are useful in recursive constructions for cyclic designs....
Kejun Chen, Ruizhong Wei
JLP
2007
81views more  JLP 2007»
13 years 9 months ago
The SL synchronous language, revisited
We revisit the SL synchronous programming model introduced by Boussinot and De Simone (IEEE, Trans. on Soft. Eng., 1996). We discuss an alternative design of the model including t...
Roberto M. Amadio
CORR
2002
Springer
67views Education» more  CORR 2002»
13 years 9 months ago
The prospects for mathematical logic in the twenty-first century
Abstract. The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory a...
Samuel R. Buss, Alexander S. Kechris, Anand Pillay...
JLP
2010
96views more  JLP 2010»
13 years 8 months ago
Implicit characterizations of FPTIME and NC revisited
Various simplified or improved, and partly corrected well-known implicit characterizations of the complexity classes FPTIME and NC are presented. Primarily, the interest is in si...
Karl-Heinz Niggl, Henning Wunderlich