Applied Mathematics and Computation

Paper

01 Jan 1992

LISP program-size complexity IV

View publication

Abstract

We present a new "character-string" oriented dialect of LISP in which the natural LISP halting probability asymptotically has maximum possible LISP complexity. © 1992.

Related

Paper

On the complexity of some geometric problems in unbounded dimension

Nimrod Megiddo

Journal of Symbolic Computation

Paper

Bonsai trees, or how to delegate a lattice basis

David Cash, Dennis Hofheinz, et al.

Journal of Cryptology

Paper

Kinematic theory of signature verification measurements

John S. Lew

Mathematical Biosciences

Paper

New omega results in a weighted divisor problem

James Lee Hafner

Journal of Number Theory

View all publications