| 
|
Quote: Turing machines and neuron nets are equivalent, also Church's lambda-definability and Kleene's primitive recursiveness
topics >
all references >
references m-o >
Topic:
Turing machine
Topic:
artificial neuron nets
Quotation Skeleton
It is easily shown: first, that every [neuron] net, if furnished with a tape, scanners connected to afferents, … Turing machine; second, that each of the latter … [i.e., cyclic] can be computed by such a net; and that nets … but no others, and not all of them. … its equivalents, Church's \lambda-definability and Kleene's primitive recursiveness: … conversely. Google-1 Google-2
Copyright clearance needed for quotation.
Topic: Turing machine (30 items)
Topic: artificial neuron nets (29 items)