109 urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891 JUCS - Journal of Universal Computer Science jucs 0948-695X 0948-6968 Journal of Universal Computer Science 10.3217/jucs-002-05-0410 27248 Research Article Chaitin's ToyLisp on a Connex Machine Stefan Gheorghe stefan@hera.pub.ro 1 Malita Mihaela 2 Politechnical University of Bucharest, Department of Electronics, Bucharest, Romania Politechnical University of Bucharest, Department of Electronics Bucharest Romania University of Bucharest, Faculty of Mathematics, Bucharest, Romania University of Bucharest, Faculty of Mathematics Bucharest Romania

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

Academic editor:

1996 28 05 1996 2 5 410 426 673AF0CF-E781-563D-87C2-1C42289C4813 6995234 Gheorghe Stefan, Mihaela Malita This article is freely available under the J.UCS Open Content License.

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.