10935 search results - page 1883 / 2187 » Neural Programming Language |
99
Voted
IFIP
2004
Springer
15 years 8 months ago
2004
Springer
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We ...
116
Voted
IFIP
2004
Springer
15 years 8 months ago
2004
Springer
Abstract A Boolean function is called normal if it is constant on flats of certain dimensions. This property is relevant for the construction and analysis of cryptosystems. This p...
125
Voted
IFIP
2004
Springer
15 years 8 months ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
115
Voted
IFIP
2004
Springer
15 years 8 months ago
2004
Springer
We introduce an extension of the Parikh mapping called the Parikh ¢ -matrix mapping, which takes its values in matrices with polynomial entries. The morphism constructed represent...
217
Voted
IFIP
2004
Springer
15 years 8 months ago
2004
Springer
Abstract The Firing Squad Synchronization Problem is one of the classical problems for cellular automata. In this paper we consider the case of more than one general. A synchronous...