Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
Paper
LISP program-size complexity IV
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
Conference paper
Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
M. Tismenetsky
International Journal of Computer Mathematics
Robert F. Gordon, Edward A. MacNair, et al.
WSC 1985