79 search results - page 1 / 16 » Universal Languages and the Power of Diagonalization |
COCO
2003
Springer
13 years 10 months ago
2003
Springer
We define and study strong diagonalization and compare it to weak diagonalization, implicit in [7]. Kozen’s result in [7] shows that virtually every separation can be recast as...
NC
2008
13 years 4 months ago
2008
We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems...
TCS
2008
13 years 4 months ago
2008
We study the computational power of pure insertion grammars. We show that pure insertion grammars of weight 3 can characterize all recursively enumerable languages. This is achiev...
MLG
2007
Springer
13 years 11 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
ECOOP
2007
Springer
13 years 11 months ago
2007
Springer
Ownership is a powerful concept to structure the object store and to control aliasing and modifications of objects. This paper presents an ownership type system for a Javalike pr...