CORR
2002
Springer
13 years 4 months ago
2002
Springer
A. Tarski 21] proposed the study of in nitary consequence operations as the central topic of mathematical logic. He considered monotonicity to be a property of all such operations...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
Self-adaptation is used in all main paradigms of evolutionary computation to increase efficiency. We claim that the basis of self-adaptation is the use of neutrality. In the absenc...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
We present a generalization of conventional artificial neural networks that allows for a functional equivalence to multi-expert systems. The new model provides an architectural fr...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
A neural network with fixed topology can be regarded as a parametrization of functions, which decides on the correlations between functional variations when parameters are adapted...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
It is next to impossible to develop real-life applications in just pure Prolog. With XPCE [5] we realised a mechanism for integrating Prolog with an external object-oriented syste...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of -theories. Relying on the notion of easy intersection type theory we succes...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
CORR
2002
Springer
13 years 4 months ago
2002
Springer
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
We demonstrate that the unbounded fan-out gate is very powerful. Constant-depth polynomial-size quantum circuits with bounded fan-in and unbounded fan-out over a fixed basis (denot...