{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:12:49Z","timestamp":1778497969643,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1996,12]]},"DOI":"10.1007\/bf01301968","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T19:55:35Z","timestamp":1111780535000},"page":"635-647","source":"Crossref","is-referenced-by-count":19,"title":["On digital nondeterminism"],"prefix":"10.1007","volume":"29","author":[{"given":"F.","family":"Cucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Matamala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01301968_CR1","doi-asserted-by":"crossref","unstructured":"J. L. Balc\u00e1zar, J. D\u00edaz, and J. Gabarr\u00f3.Structural Complexity I. EATCS Monographs on Theoretical Computer Science, vol. 11. Springer-Verlag, 1988.","DOI":"10.1007\/978-3-642-97062-7"},{"key":"BF01301968_CR2","doi-asserted-by":"crossref","unstructured":"E. Bienenstock, F. Fogelman-Soulie, and G. Weisbuch, eds.Disordered Systems and Biological Organization. NATO ASI, Series F: Computer and System Sciences. Springer-Verlag, 1986.","DOI":"10.1007\/978-3-642-82657-3"},{"issue":"1","key":"BF01301968_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L. Blum","year":"1989","unstructured":"L. Blum, M. Shub, and S. Smale. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines.Bulletin of the American Mathematical Society, 21(1): 1\u201346, 1989.","journal-title":"Bulletin of the American Mathematical Society"},{"key":"BF01301968_CR4","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/0885-064X(92)90024-6","volume":"8","author":"F. Cucker","year":"1992","unstructured":"F. Cucker. P\u211d \u2260 NC\u211d.Journal of Complexity, 8:230\u2013238, 1992.","journal-title":"Journal of Complexity"},{"issue":"5","key":"BF01301968_CR5","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1093\/comjnl\/36.5.400","volume":"36","author":"F. Cucker","year":"1993","unstructured":"F. Cucker. On the complexity of quantifier elimination: The structural approach.The Computer Journal, 36(5):400\u2013408, 1993.","journal-title":"The Computer Journal"},{"key":"BF01301968_CR6","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1016\/0885-064X(92)90008-Y","volume":"8","author":"F. Cucker","year":"1992","unstructured":"F. Cucker and A. Torrecillas. Two P-complete problems in the theory of the reals.Journal of Complexity, 8:454\u2013466, 1992.","journal-title":"Journal of Complexity"},{"key":"BF01301968_CR7","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0022-0000(79)90054-0","volume":"18","author":"D. P. Dobkin","year":"1979","unstructured":"D. P. Dobkin and R. J. Lipton. On the complexity of computations under varying sets of primitives.Journal of Computer and System Sciences, 18:86\u201391, 1979.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"BF01301968_CR8","doi-asserted-by":"crossref","first-page":"92","DOI":"10.2307\/2275252","volume":"59","author":"J. B. Goode","year":"1994","unstructured":"J. B. Goode. Accessible telephone directories.Journal of Symbolic Logic, 59(1):92\u2013105, 1994.","journal-title":"Journal of Symbolic Logic"},{"key":"BF01301968_CR9","doi-asserted-by":"crossref","unstructured":"J. J. Hopfield. Neural networks and physical systems with emergent collective computational abilities. InProceedings of the National Academy of Sciences, USA, vol. 79, pages 2554\u20132558, 1982.","DOI":"10.1073\/pnas.79.8.2554"},{"key":"BF01301968_CR10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"J. J. Hopfield","year":"1985","unstructured":"J. J. Hopfield and D. W. Tank. Neural computation of decisions in optimization problems.Biology Cybernetics, 52:141\u2013152, 1985.","journal-title":"Biology Cybernetics"},{"key":"BF01301968_CR11","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(76)90068-2","volume":"3","author":"N. D. Jones","year":"1977","unstructured":"N. D. Jones and W. T. Laaser. Complete problems for deterministic polynomial time.Theoretical Computer Science, 3:105\u2013117, 1977.","journal-title":"Theoretical Computer Science"},{"key":"BF01301968_CR12","unstructured":"P. Koiran.Puissance de calcul des reseaux de neurones artificiels. PhD thesis. \u00c9cole Normale Sup\u00e9rieure de Lyon, June 1993."},{"key":"BF01301968_CR13","doi-asserted-by":"crossref","unstructured":"W. Maass. Bounds for the computational power and learning complexity of analog neural nets. InProceedinmgs of the 25th STOC, pages 335\u2013344, 1993.","DOI":"10.1145\/167088.167193"},{"key":"BF01301968_CR14","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0885-064X(92)90007-X","volume":"8","author":"K. Meer","year":"1992","unstructured":"K. Meer. A note on a P \u2260 NP result for a restricted class of real machines.Journal of Complexity, 8:451\u2013453, 1992.","journal-title":"Journal of Complexity"},{"key":"BF01301968_CR15","first-page":"435","volume":"309","author":"C. Michaux","year":"1989","unstructured":"C. Michaux. Une remarque a propos des machines sur \u211d introduites par Blum, Shub et Smale.C. R. Academic Science Paris, 309, S\u00e9rie 1:435\u2013437, 1989.","journal-title":"C. R. Academic Science Paris"},{"issue":"2","key":"BF01301968_CR16","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0304-3975(94)90178-3","volume":"131","author":"H. T. Siegelmann","year":"1994","unstructured":"H. T. Siegelmann and E. D. Sontag. Analog computation via neural networks.Theoretical Computer Science, 131(2):331\u2013360, 1994.","journal-title":"Theoretical Computer Science"},{"key":"BF01301968_CR17","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1146\/annurev.cs.03.060188.001533","volume":"3","author":"J. Gathen von zur","year":"1988","unstructured":"J. von zur Gathen. Algebraic complexity theory.Annual Review of Computer Science, 3:317\u2013347, 1988.","journal-title":"Annual Review of Computer Science"},{"key":"BF01301968_CR18","unstructured":"X. D. Zhang. Complexity of neural networks learning in the real number model. Technical Report. University of Massachusets at Amherst, 1992."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01301968.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01301968\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01301968","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T18:53:51Z","timestamp":1683053631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01301968"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":18,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["BF01301968"],"URL":"https:\/\/doi.org\/10.1007\/bf01301968","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}