{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:47:46Z","timestamp":1725490066178},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735533"},{"type":"electronic","value":"9783540735540"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73554-0_5","type":"book-chapter","created":{"date-parts":[[2007,8,22]],"date-time":"2007-08-22T13:27:13Z","timestamp":1187789233000},"page":"29-40","source":"Crossref","is-referenced-by-count":0,"title":["Unconventional Models of Computation Through Non-standard Logic Circuits"],"prefix":"10.1007","author":[{"given":"Juan C.","family":"Agudelo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Carnielli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Agudelo, J.C., Carnielli, W.: Quantum algorithms, paraconsistent computation and Deutsch\u2019s problem. In: Prasad, B. (ed.) Proceedings of the 2nd Indian International Conference on Artificial Intelligence, Pune, India, pp. 1609\u20131628 (2005)"},{"key":"5_CR2","volume-title":"Computability and logic","author":"G. Boolos","year":"1989","unstructured":"Boolos, G., Jeffrey, R.: Computability and logic, 3rd edn. Cambridge University Press, Cambridge (1989)","edition":"3"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF01470748","volume":"148","author":"J. Richard B\u00fcchi","year":"1962","unstructured":"Richard B\u00fcchi, J.: Turing-machines and the Entscheidungsproblem. Mathematische Annalen\u00a0148, 201\u2013213 (1962)","journal-title":"Mathematische Annalen"},{"key":"5_CR4","unstructured":"Calabro, C.: Turing Machine vs. RAM Machine vs. Circuits. Lecture notes, available at \n                    \n                      http:\/\/www-cse.ucsd.edu\/classes\/fa06\/cse200\/ln2.ps"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Coniglio Carlos Caleiro, M.E., Carnielli, W., Marcos, J.: Two\u2019s company: the humbug of many logical values. In: Beziau, J.-Y. (ed.) Logica Universalis, pp. 169\u2013189. Birkh\u00e4user Verlag, Basel, Switzerland (preprint available at) \n                    \n                      http:\/\/wslc.math.ist.utl.pt\/ftp\/pub\/CaleiroC\/05-CCCM-dyadic.pdf","DOI":"10.1007\/3-7643-7304-0_10"},{"key":"5_CR6","unstructured":"Carnielli, W.A.: Polynomial ring calculus for many-valued logics. In: Werner, B. (ed.) Proceedings of the 35th International Symposium on Multiple-Valued Logic, pp. 20\u201325. IEEE Computer Society, Los Alamitos (2005), (preprint available at CLE e-Prints vol 5(3), 2005), \n                    \n                      http:\/\/www.cle.unicamp.br\/e-prints\/vol_5,n_3,2005.html"},{"key":"5_CR7","unstructured":"Carnielli, W.A., Coniglio, M.E., Marcos, J.: Logics of Formal Inconsistency. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, 2nd edn. vol.\u00a014, Kluwer Academic Publishers, Dordrecht (2005), (in print. preprint available at CLE e-Prints vol 5(1), 2005), \n                    \n                      http:\/\/www.cle.unicamp.br\/e-prints\/vol_5,n_1,2005.html"},{"key":"5_CR8","volume-title":"Quantum Computation and Quantum Information","author":"I.L. Chuang","year":"2000","unstructured":"Chuang, I.L., Nielsen, M.A.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"5_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04943-3","volume-title":"Boolean Functions and Computation Models","author":"P. Clote","year":"2002","unstructured":"Clote, P., Kranakis, E.: Boolean Functions and Computation Models. Springer, Heidelberg (2002)"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/800157.805047","volume-title":"Proceedings of the Third Annual ACM Symposium on the Theory of Computing","author":"S.A. Cook","year":"1971","unstructured":"Cook, S.A.: The complexity of theorem proving procedures. In: Proceedings of the Third Annual ACM Symposium on the Theory of Computing, pp. 151\u2013158. ACM Press, New York (1971)"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1023\/A:1021105915386","volume":"12","author":"J. Copeland","year":"2002","unstructured":"Copeland, J.: Hypercomputation. Minds and machines\u00a012, 461\u2013502 (2002)","journal-title":"Minds and machines"},{"key":"5_CR12","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-3-662-05642-4_8","volume-title":"Alan Turing: Life and Legacy of a Great Thinker","author":"M. Davis","year":"2004","unstructured":"Davis, M.: The myth of hypercomputation. In: Teuscher, C. (ed.) Alan Turing: Life and Legacy of a Great Thinker, pp. 195\u2013212. Springer, Heidelberg (2004)"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.amc.2005.09.066","volume":"178","author":"M. Davis","year":"2004","unstructured":"Davis, M.: Why there is no such discipline as hypercomputation. Applied Mathematics and Computation\u00a0178, 4\u20137 (2004)","journal-title":"Applied Mathematics and Computation"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.physrep.2005.03.003","volume":"413","author":"M. Genovese","year":"2005","unstructured":"Genovese, M.: Research on hidden variable theories: A review of recent progresses. Physics Reports\u00a0413, 319\u2013396 (2005)","journal-title":"Physics Reports"},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"213","DOI":"10.2307\/2687775","volume":"7","author":"J.Y. Halpern","year":"2001","unstructured":"Halpern, J.Y., Harper, R., Immerman, N., Kolaitis, P.G., Vardi, M.Y., Vianu, V.: On the unusual effectiveness of logic in computer science. The Bulletin of Symbolic Logic\u00a07(2), 213\u2013236 (2001)","journal-title":"The Bulletin of Symbolic Logic"},{"key":"5_CR16","volume-title":"Basic Algebra I","author":"N. Jacobson","year":"1985","unstructured":"Jacobson, N.: Basic Algebra I, 2nd edn. W. H. Freeman and Company, New York (1985)","edition":"2"},{"key":"5_CR17","volume-title":"Computational Complexity","author":"C. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: Computational Complexity. Adisson-Wesley, London, UK (1994)"},{"key":"5_CR18","unstructured":"Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. In: Proceedings of the London Mathematical Society, pp. 230\u2013265 (1936) (A correction, ibid, vol 43, pp. 544\u2013546, 1936-1937)"}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73554-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:10:26Z","timestamp":1558275026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73554-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540735533","9783540735540"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73554-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}