We present upper bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is no more powerful than sequential space, thus gi...
We present lower bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is at least as powerful as sequential space, thus ...
We introduce the on-the-fly model-checker OFMC, a tool that combines two methods for analyzing security protocols. The first is the use of lazy data-types as a simple way of buil...
This paper presents results from lesion experiments on a modular attractor neural network model of semantic access. Real picture data forms the basis of perceptual input to the mod...
William Power, Ray J. Frank, D. John Done, Neil Da...
We present a model for representing search in theorem proving. This model captures the notion of contraction, which has been central in some of the recent developments in theorem ...