Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!mips!spool.mu.edu!munnari.oz.au!brolga!uqcspe!cs.uq.oz.au!matthew
From: matthew@cs.uq.oz.au (Matthew McDonald)
Newsgroups: comp.theory
Subject: Naive question
Message-ID: <755@uqcspe.cs.uq.oz.au>
Date: 12 Apr 91 03:49:02 GMT
Sender: news@cs.uq.oz.au
Reply-To: matthew@cs.uq.oz.au
Lines: 13


	I pretty sure the answer to this is no, but I'd be interested
in knowing why exactly. If the answer is yes, even better. :-)
I'll collect replies and summarize to the net if there's any interest.
Sorry if the question is too stupid. 
	In general, is there a recursively enumerable set of functions which
are guaranteed to terminate for all input from a given domain, such that for
*any* function f, terminating for at least some input from that same input
domain, there is a member of the enumerated set whose input/output pairs are
a superset of the set of input/output pairs of f (Where the set of i/o pairs
for f includes only input for which f terminates.)
	I'd appreciate anything you got, thanks in anticipation,
		Matthew.