Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!swrinde!elroy.jpl.nasa.gov!decwrl!stanford.edu!neon.Stanford.EDU!Gang-of-Four.Stanford.EDU!iam
From: iam@Gang-of-Four.Stanford.EDU (Ian Mason)
Newsgroups: comp.theory
Subject: Re: Naive question
Message-ID: <1991Apr12.193006.20310@neon.Stanford.EDU>
Date: 12 Apr 91 19:30:06 GMT
References: <755@uqcspe.cs.uq.oz.au>
Sender: news@neon.Stanford.EDU (USENET News System)
Reply-To: iam@Gang-of-Four.Stanford.EDU (Ian Mason)
Organization: Stanford University
Lines: 8

if by a recursively enumerable set of functions you 
mean a recursively enumerable set of indices of such
fuctions, then the rice shapiro theorem gives a strong
negative answer to you question. a reference to it is
nigel cutland's computability.


		-iam-