# To prove Turing-completeness, is it enough to prove capability of producing arbitrary output?

Turing completness is being typically proved via reduction to already proved Turing-complete machine.

Can the same be obtained by showing, that the machine in question is capable of generating arbitrary output – if proper input is given?

-
What is "arbitrary output" supposed to mean? –  Raphael Nov 1 '12 at 14:18
agree question in current form is too vague or not well defined –  vzn Nov 1 '12 at 16:58

Turing-completeness means that the machine model in question can compute everything that is computable. That means that for every computable function $f$, there is a corresponding program for your model which behaves "like" $f$, where I put the quotes since the input and output may look differently.