M. Tismenetsky
International Journal of Computer Mathematics
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
A. Skumanich
SPIE OE/LASE 1992
Zhengxin Zhang, Ziv Goldfeld, et al.
Foundations of Computational Mathematics
Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering