1997 Paper 4 Question 8 Computation Theory Define what is meant by saying that a set of partial recursive (µR) functions is recursively enumerable. Explain briefly how the universal register machine might be used to de

First Page		Document Content
Date: 2014-06-09 10:17:16		1997 Paper 4 Question 8 Computation Theory Define what is meant by saying that a set of partial recursive (µR) functions is recursively enumerable. Explain briefly how the universal register machine might be used to de Add to Reading List Source URL: www.cl.cam.ac.uk Download Document from Source Website File Size: 49,79 KB Share Document on Facebook