Towards a minimal calculus for complexation
Abstract. We present here a termination preserving encoding of Minsky Machines in a particularly restricted fragment of the κ-calculus where only one species with no fields is admitted and only binary rules are allowed.
Sorry, we are unable to provide the full text but you may find it at the following location(s):
http://citeseerx.ist.psu.edu/v... (external link)
http://www.cs.unibo.it/%7Edigi... (external link)