Nine switch-affine neurons suffice for turing universality

Authors:
H. T. Siegelmann;M. Margenstern
Affiliations:
-;-
Venue:
Neural Networks
Year:
1999

Citing 0
Cited 3

The Complexity of Small Universal Turing Machines

CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
The complexity of small universal Turing machines: A survey

Theoretical Computer Science
The complexity of small universal turing machines: a survey

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract