JUCS - Journal of Universal Computer Science 2(5): 410-426, doi: 10.3217/jucs-002-05-0410
Chaitin's ToyLisp on a Connex Machine
expand article infoGheorghe Stefan‡, Mihaela Malita§
‡ Politechnical University of Bucharest, Department of Electronics, Bucharest, Romania§ University of Bucharest, Faculty of Mathematics, Bucharest, Romania

Corresponding author: Gheorghe Stefan ( stefan@hera.pub.ro )

© Gheorghe Stefan, Mihaela Malita.
This article is freely available under the J.UCS Open Content License.
Citation: Stefan G, Malita M (1996) Chaitin's ToyLisp on a Connex Machine. JUCS - Journal of Universal Computer Science 2(5): 410-426. https://doi.org/10.3217/jucs-002-05-0410
Open Access
Abstract
This paper describes an implementation of Chaitin's ToyLisp [Chaitin '87] on a Connex Memory Machine (CMM) [Stefan '85]. The Connex Memory Machine has a smaller complexity than previous Universal Machines used to run Lisp programs, so the time and space used in running Lisp programs can be considerably decreased. A ToyLisp like language can be used with a CMM to construct a Lisp (Co)Processor for accelerating Lisp processing in conventional architectures. 1.) C. Calude (ed.). The Finite, the Unbounded and the Infinite, Proceedings of the Summer School "Chaitin Complexity and Applications", Mangalia, Romania, 27 June - 6 July, 1995.