{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T06:42:42Z","timestamp":1765608162731,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540851936"},{"type":"electronic","value":"9783540851943"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85194-3_6","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T06:21:05Z","timestamp":1219126865000},"page":"33-50","source":"Crossref","is-referenced-by-count":7,"title":["Oracles and Advice as Measurements"],"prefix":"10.1007","author":[{"given":"Edwin","family":"Beggs","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 F\u00e9lix","family":"Costa","sequence":"additional","affiliation":[]},{"given":"Bruno","family":"Loff","sequence":"additional","affiliation":[]},{"given":"John V.","family":"Tucker","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-79235-9","volume-title":"Structural Complexity I","author":"J.L. Balc\u00e1zar","year":"1995","unstructured":"Balc\u00e1zar, J.L., D\u00edas, J., Gabarr\u00f3, J.: Structural Complexity I, 2nd edn. Springer, Heidelberg (1995)","edition":"2"},{"key":"6_CR2","series-title":"Lecture notes in pure and applied mathematics","first-page":"1175","volume-title":"Complexity, logic, and recursion theory","author":"J.L. Balc\u00e1zar","year":"1997","unstructured":"Balc\u00e1zar, J.L., Gavald\u00e0, R., Hermo, M.: Compressibility of infinite binary sequences. In: Sorbi, A. (ed.) Complexity, logic, and recursion theory. Lecture notes in pure and applied mathematics, vol.\u00a0187, pp. 1175\u20131183. Marcel Dekker, Inc., New York (1997)"},{"issue":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1109\/18.605580","volume":"43","author":"J.L. Balc\u00e1zar","year":"1997","unstructured":"Balc\u00e1zar, J.L., Gavald\u00e0, R., Siegelmann, H.: Computational power of neural networks: a characterization in terms of Kolmogorov complexity. IEEE Transactions on Information Theory\u00a043(4), 1175\u20131183 (1997)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1109\/SCT.1993.336521","volume-title":"Proceedings of the Eighth IEEE Structure in Complexity Theory Conference","author":"J.L. Balc\u00e1zar","year":"1993","unstructured":"Balc\u00e1zar, J.L., Gavald\u00e0, R., Siegelmann, H., Sontag, E.D.: Some structural complexity aspects of neural computation. In: Proceedings of the Eighth IEEE Structure in Complexity Theory Conference, pp. 253\u2013265. IEEE Computer Society, Los Alamitos (1993)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-540-79228-4_2","volume-title":"Theory and Applications of Models of Computation","author":"E. Beggs","year":"2008","unstructured":"Beggs, E., Costa, J.F., Loff, B., Tucker, J.: On the complexity of measurement in classical physics. In: Agrawal, M., Du, D., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol.\u00a04978, pp. 20\u201330. Springer, Heidelberg (2008)"},{"key":"6_CR6","unstructured":"Beggs, E., Costa, J.F., Loff, B., Tucker, J.: Computational complexity with experiments as oracles. Proc. Royal Society, Ser. A (in press)"},{"issue":"2082","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1541","DOI":"10.1098\/rspa.2007.1835","volume":"463","author":"E. Beggs","year":"2007","unstructured":"Beggs, E., Tucker, J.: Experimental computation of real numbers by Newtonian machines. Proc. Royal Society, Ser. A\u00a0463(2082), 1541\u20131561 (2007)","journal-title":"Proc. Royal Society, Ser. A"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Machines, Computations, and Universality","author":"C. Calude","year":"2005","unstructured":"Calude, C.: Algorithmic randomness, quantum physics, and incompleteness. In: Margenstern, M. (ed.) MCU 2004. LNCS, vol.\u00a03354, pp. 1\u201317. Springer, Heidelberg (2005)"},{"key":"6_CR9","series-title":"University series in mathematics","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/978-1-4615-0755-0_6","volume-title":"Computability and Models, Perspectives East and West","author":"B. Cooper","year":"2003","unstructured":"Cooper, B., Odifreddi, P.: Incomputability in Nature. In: Cooper, B., Goncharov, S. (eds.) Computability and Models, Perspectives East and West. University series in mathematics, pp. 137\u2013160. Springer, Heidelberg (2003)"},{"key":"6_CR10","unstructured":"Copeland, J.: The Church\u2013Turing thesis. In: Zalta, E. (ed.) The Stanford Enciclopedia of Phylosophy (published, 2002), \n                      http:\/\/plato.stanford.edu\/archives\/fall2002\/entries\/church-turing\/"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1038\/scientificamerican0499-98","volume":"280","author":"J. Copeland","year":"1999","unstructured":"Copeland, J., Proudfoot, D.: Alan Turing\u2019s forgotten ideas in Computer Science. Scientific American\u00a0280, 99\u2013103 (1999)","journal-title":"Scientific American"},{"key":"6_CR12","first-page":"195","volume-title":"Alan Turing: the life and legacy of a great thinker","author":"M. Davis","year":"2006","unstructured":"Davis, M.: The myth of hypercomputation. In: Teuscher, C. (ed.) Alan Turing: the life and legacy of a great thinker, pp. 195\u2013212. Springer, Heidelberg (2006)"},{"key":"6_CR13","unstructured":"Hodges, A.: The professors and the brainstorms (published, 1999), \n                      http:\/\/www.turing.org.uk\/philosophy\/sciam.html"},{"key":"6_CR14","volume-title":"From Stonehenge to Modern Cosmology","author":"F. Hoyle","year":"1972","unstructured":"Hoyle, F.: From Stonehenge to Modern Cosmology. W.H. Freeman, New York (1972)"},{"key":"6_CR15","unstructured":"Kobayashi, K.: On compressibility of infinite sequences. Technical Report C\u201334, Research Reports on Information Sciences (1981)"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0019-9958(69)90538-5","volume":"15","author":"D.W. Loveland","year":"1969","unstructured":"Loveland, D.W.: A variant of the Kolmogorov concept of complexity. Information and Control\u00a015, 115\u2013133 (1969)","journal-title":"Information and Control"},{"key":"6_CR17","unstructured":"Newham, C.A.: The Astronomical Significance of Stonehenge. Coats and Parker Ltd (2000) (First published, 1972)"},{"key":"6_CR18","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198519737.001.0001","volume-title":"The Emperor\u2019s New Mind","author":"R. Penrose","year":"1989","unstructured":"Penrose, R.: The Emperor\u2019s New Mind. Oxford University Press, Oxford (1989)"},{"key":"6_CR19","volume-title":"Shadows of the Mind","author":"R. Penrose","year":"1994","unstructured":"Penrose, R.: Shadows of the Mind. Oxford University Press, Oxford (1994)"},{"key":"6_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0707-8","volume-title":"Neural Networks and Analog Computation: Beyond the Turing Limit","author":"H.T. Siegelmann","year":"1999","unstructured":"Siegelmann, H.T.: Neural Networks and Analog Computation: Beyond the Turing Limit. Birkh\u00e4user, Basel (1999)"},{"key":"6_CR21","series-title":"University Series in Mathematics","first-page":"317","volume-title":"Handbook of Logic for Computer Science","author":"J.V. Tucker","year":"2000","unstructured":"Tucker, J.V., Zucker, J.I.: Computable functions and semicomputable sets on many sorted algebras. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic for Computer Science. University Series in Mathematics, vol.\u00a0V, pp. 317\u2013523. Oxford University Press, Oxford (2000)"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1145\/1024922.1024924","volume":"5","author":"J.V. Tucker","year":"2004","unstructured":"Tucker, J.V., Zucker, J.I.: Abstract versus concrete computation on metric partial algebras. ACM Transactions on Computational Logic\u00a05, 611\u2013668 (2004)","journal-title":"ACM Transactions on Computational Logic"}],"container-title":["Lecture Notes in Computer Science","Unconventional Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85194-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,11]],"date-time":"2024-05-11T04:05:35Z","timestamp":1715400335000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85194-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540851936","9783540851943"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85194-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}