{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:10:21Z","timestamp":1743142221278,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030040697"},{"type":"electronic","value":"9783030040703"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04070-3_36","type":"book-chapter","created":{"date-parts":[[2018,11,21]],"date-time":"2018-11-21T13:56:27Z","timestamp":1542808587000},"page":"460-472","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Three Analog Neurons Are Turing Universal"],"prefix":"10.1007","author":[{"given":"Ji\u0159\u00ed","family":"\u0160\u00edma","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,22]]},"reference":[{"issue":"2","key":"36_CR1","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1145\/103516.103523","volume":"38","author":"N Alon","year":"1991","unstructured":"Alon, N., Dewdney, A.K., Ott, T.J.: Efficient simulation of finite automata by neural nets. J. ACM 38(2), 495\u2013514 (1991)","journal-title":"J. ACM"},{"issue":"4","key":"36_CR2","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1109\/18.605580","volume":"43","author":"JL Balc\u00e1zar","year":"1997","unstructured":"Balc\u00e1zar, J.L., Gavald\u00e0, R., Siegelmann, H.T.: Computational power of neural networks: a characterization in terms of Kolmogorov complexity. IEEE Trans. Inf. Theory 43(4), 1175\u20131183 (1997)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"36_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0893-6080(95)00095-X","volume":"9","author":"BG Horne","year":"1996","unstructured":"Horne, B.G., Hush, D.R.: Bounds on the complexity of recurrent neural network implementations of finite state machines. Neural Netw. 9(2), 243\u2013252 (1996)","journal-title":"Neural Netw."},{"key":"36_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-59042-0_85","volume-title":"STACS 95","author":"P Indyk","year":"1995","unstructured":"Indyk, P.: Optimal simulation of automata by neural nets. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 337\u2013348. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59042-0_85"},{"issue":"1","key":"36_CR5","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1006\/inco.1996.0062","volume":"128","author":"J Kilian","year":"1996","unstructured":"Kilian, J., Siegelmann, H.T.: The dynamic universality of sigmoidal neural networks. Inf. Comput. 128(1), 48\u201356 (1996)","journal-title":"Inf. Comput."},{"issue":"2","key":"36_CR6","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0304-3975(96)00088-6","volume":"168","author":"P Koiran","year":"1996","unstructured":"Koiran, P.: A family of universal recurrent networks. Theor. Comput. Sci. 168(2), 473\u2013480 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"36_CR7","first-page":"109","volume":"26","author":"OB Lupanov","year":"1973","unstructured":"Lupanov, O.B.: On the synthesis of threshold circuits. Probl. Kibern. 26, 109\u2013140 (1973)","journal-title":"Probl. Kibern."},{"key":"36_CR8","volume-title":"Computations: Finite and Infinite Machines","author":"M Minsky","year":"1967","unstructured":"Minsky, M.: Computations: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)"},{"issue":"1\u20132","key":"36_CR9","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(96)00017-5","volume":"174","author":"P Orponen","year":"1997","unstructured":"Orponen, P.: Computing with truly asynchronous threshold logic networks. Theor. Comput. Sci. 174(1\u20132), 123\u2013136 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.neunet.2014.09.003","volume":"61","author":"J Schmidhuber","year":"2015","unstructured":"Schmidhuber, J.: Deep learning in neural networks: an overview. Neural Netw. 61, 85\u2013117 (2015)","journal-title":"Neural Netw."},{"issue":"4","key":"36_CR11","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1111\/j.1467-8640.1996.tb00277.x","volume":"12","author":"HT Siegelmann","year":"1996","unstructured":"Siegelmann, H.T.: Recurrent neural networks and finite automata. J. Comput. Intell. 12(4), 567\u2013574 (1996)","journal-title":"J. Comput. Intell."},{"key":"36_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0707-8","volume-title":"Neural Networks and Analog Computation: Beyond the Turing Limit","author":"HT Siegelmann","year":"1999","unstructured":"Siegelmann, H.T.: Neural Networks and Analog Computation: Beyond the Turing Limit. Birkh\u00e4user, Boston (1999)"},{"issue":"2","key":"36_CR13","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0304-3975(94)90178-3","volume":"131","author":"HT Siegelmann","year":"1994","unstructured":"Siegelmann, H.T., Sontag, E.D.: Analog computation via neural networks. Theor. Comput. Sci. 131(2), 331\u2013360 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"36_CR14","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/jcss.1995.1013","volume":"50","author":"HT Siegelmann","year":"1995","unstructured":"Siegelmann, H.T., Sontag, E.D.: On the computational power of neural nets. J. Comput. Syst. Sci. 50(1), 132\u2013150 (1995)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"36_CR15","first-page":"679","volume":"7","author":"J \u0160\u00edma","year":"1997","unstructured":"\u0160\u00edma, J.: Analog stable simulation of discrete neural networks. Neural Netw. World 7(6), 679\u2013686 (1997)","journal-title":"Neural Netw. World"},{"issue":"5","key":"36_CR16","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1162\/NECO_a_00579","volume":"26","author":"J \u0160\u00edma","year":"2014","unstructured":"\u0160\u00edma, J.: Energy complexity of recurrent neural networks. Neural Comput. 26(5), 953\u2013973 (2014)","journal-title":"Neural Comput."},{"key":"36_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-319-13749-0_21","volume-title":"Theory and Practice of Natural Computing","author":"J \u0160\u00edma","year":"2014","unstructured":"\u0160\u00edma, J.: The power of extra analog neuron. In: Dediu, A.-H., Lozano, M., Mart\u00edn-Vide, C. (eds.) TPNC 2014. LNCS, vol. 8890, pp. 243\u2013254. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13749-0_21"},{"doi-asserted-by":"crossref","unstructured":"\u0160\u00edma, J.: Neural networks between integer and rational weights. In: Proceedings of the IJCNN 2017 Thirties International Joint Conference on Neural Networks, pp. 154\u2013161. IEEE (2017)","key":"36_CR18","DOI":"10.1109\/IJCNN.2017.7965849"},{"issue":"12","key":"36_CR19","doi-asserted-by":"publisher","first-page":"2727","DOI":"10.1162\/089976603322518731","volume":"15","author":"J \u0160\u00edma","year":"2003","unstructured":"\u0160\u00edma, J., Orponen, P.: General-purpose computation with neural networks: a survey of complexity theoretic results. Neural Comput. 15(12), 2727\u20132778 (2003)","journal-title":"Neural Comput."},{"key":"36_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2018.02.028","volume":"720","author":"J \u0160\u00edma","year":"2018","unstructured":"\u0160\u00edma, J., Savick\u00fd, P.: Quasi-periodic $$\\beta $$-expansions and cut languages. Theor. Comput. Sci. 720, 1\u201323 (2018)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"36_CR21","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1145\/273865.273914","volume":"45","author":"J \u0160\u00edma","year":"1998","unstructured":"\u0160\u00edma, J., Wiedermann, J.: Theory of neuromata. J. ACM 45(1), 155\u2013178 (1998)","journal-title":"J. ACM"},{"key":"36_CR22","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.neucom.2003.12.005","volume":"62","author":"M \u0160orel","year":"2004","unstructured":"\u0160orel, M., \u0160\u00edma, J.: Robust RBF finite automata. Neurocomputing 62, 93\u2013110 (2004)","journal-title":"Neurocomputing"}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04070-3_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T14:25:42Z","timestamp":1614867942000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-04070-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030040697","9783030040703"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04070-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"22 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TPNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Practice of Natural Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tpnc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tpnc2018.irdta.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}