utms and connex

[Steve Hanson]

Another sort of interesting question concerning turing equivalence
is learning.  The sort of McCulloch and Pitts question and
others that are usually posed concerns representation, can
a net "with cycles" (cf. M&P, 1943) represent a turing machine?
Another question along these lines is can a net learn to 
represent a turing machine (see williams and zipser for example)
and under what conditions etc... anybody thought about that?
Are there standard references from the learnability/complexity
literature or more recent ones?

	Steve