The weight of evidence supporting the case for hypercomputation is compelling. We examine some 20 physical and mathematical models of computation that are either known or suspecte...
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...
Abstract. Dialogue moves influence and are influenced by the agents’ preferences. We propose a method for modelling this interaction. We motivate and describe a recursive metho...
This paper studies system identification of ARMA models whose outputs are subject to finite-level quantization and random packet dropouts. A simple adaptive quantizer and the co...
Some recent methods of Computer Aided Geometric Design are related to the apolar bilinear form, an inner product on the space of homogeneous multivariate polynomials of a fixed deg...