@inproceedings{8f42b0b10b134205bfa9deb9020212f1,

title = "What NARX networks can compute",

abstract = "We prove that a class of architectures called NARX neural networks, popular in control applications and other problems, are at least as powerful as fully connected recurrent neural networks. Recent results have shown that fully connected networks are Turing equivalent. Building on those results, we prove that NARX networks are also universal computation devices. NARX networks have a limited feedback which comes only from the output neuron rather than from hidden states. There is much interest in the amount and type of recurrence to be used in recurrent neural networks. Our results pose the question of what amount of feedback or recurrence is necessary for any network to be Turing equivalent and what restrictions on feedback limit computational power.",

author = "Horne, {Bill G.} and Siegelmann, {Hava T.} and {Lee Giles}, C.",

year = "1995",

doi = "10.1007/3-540-60609-2_5",

language = "English (US)",

isbn = "3540606092",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "95--102",

editor = "Miroslav Bartosek and Jan Staudek and Jiri Wiedermann",

booktitle = "SOFSEM 1995",

address = "Germany",

note = "22nd International Seminar on Current Trends in Theory and Practice of Informatics, SOFSEM 1995 ; Conference date: 23-11-1995 Through 01-12-1995",

}