Path: utzoo!attcan!uunet!mcvax!hp4nl!ruuinf!piet
From: piet@ruuinf (Piet van Oostrum)
Newsgroups: comp.misc
Subject: Re: a (probably) dumb question
Message-ID: <988@ruuinf.UUCP>
Date: 18 Jan 89 14:01:04 GMT
References: <43638@linus.UUCP>
Sender: piet@ruuinf.UUCP
Reply-To: piet@ruuinf (Piet van Oostrum)
Organization: Dept of Computer Science, University of Utrecht, Holland
Lines: 14
In-reply-to: jfjr@mbunix.mitre.org (Jerome Freedman)

In article <43638@linus.UUCP>, jfjr@mbunix (Jerome Freedman) writes:
 `
 `   I have seen the phrase "turing complete" applied to 
 `languages (PostScript etc). I know what it means but
 `I'd like a formal definition.
 `
The most formal you can get is:

For every function that is computable by a Turing machine, there is a
program in the (said) language that computes that function.
-- 
Piet van Oostrum, Dept of Computer Science, University of Utrecht
Padualaan 14, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands
Telephone: +31-30-531806. piet@cs.ruu.nl (mcvax!hp4nl!ruuinf!piet)