Chaitin's ToyLisp on a Connex Machine
Gheorghe Stefan (Politechnical University of Bucharest, Department of Electronics, Romania)
Mihaela Malita (University of Bucharest, Faculty of Mathematics, Romania)
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.