Polynomial time over the reals with parsimony
Abstract
We provide a characterization of Ko's class of polynomial time computable functions over real numbers. This characterization holds for a stream based language using a parsimonious type discipline, a variant of propositional linear logic. We obtain a first characterization of polynomial time computations over the reals on a higher-order functional language using a linear/affine type system.
| Origin | Files produced by the author(s) |
|---|
Loading...