{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:23:07Z","timestamp":1725488587952},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540443117"},{"type":"electronic","value":"9783540458333"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45833-6_24","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T06:25:53Z","timestamp":1186813553000},"page":"287-299","source":"Crossref","is-referenced-by-count":12,"title":["Relativistic Computers and Non-uniform Complexity Theory"],"prefix":"10.1007","author":[{"given":"Ji\u0159\u00ed","family":"Wiedermann","sequence":"first","affiliation":[]},{"given":"Jan","family":"van Leeuwen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,10,10]]},"reference":[{"key":"24_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":"J. L. Balc\u00e1zar, J. D\u00edaz, J. Gabarr\u00f3: Structural complexity I, Second Edition, Springer-Verlag, Berlin, 1995.","edition":"Second Edition"},{"key":"24_CR2","series-title":"PhD thesis","volume-title":"Query-limited reducibilities","author":"R. Beigel","year":"1995","unstructured":"R. Beigel, Query-limited reducibilities, PhD thesis, Department of Computer Science, Stanford University, Stanford, 1995, available at http:\/\/www.eccc.uni-trier.de\/eccc-local\/ECCC-Theses\/beigel.html ."},{"key":"24_CR3","first-page":"453","volume-title":"Complexity and real computation","author":"M. Blum","year":"1997","unstructured":"M. Blum, F. Cucker, M. Shub, M. Smale: Complexity and real computation. Springer, New York, 1997, 453p."},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/384150.384166","volume":"44","author":"M. Burgin","year":"2001","unstructured":"M. Burgin: How we know what technology can do, Communications of the ACM 44 (2001) 83\u201388.","journal-title":"Communications of the ACM"},{"key":"24_CR5","volume-title":"Technical Report CDMTCS-170","author":"C.S. Calude","year":"2001","unstructured":"C.S. Calude, Pavlov, B.: Coins, quantum measurements, and Turing\u2019s barrier, Technical Report CDMTCS-170, University of Auckland, New Zealand, December 2001."},{"key":"24_CR6","first-page":"231","volume-title":"P. Benacerraf and his critics, Philosophers and Their Critics","author":"J. Earman","year":"1996","unstructured":"J. Earman, J. Norton: Infinite pains: The trouble with supertasks, in A. Morton and S.P. Stich (eds.), P. Benacerraf and his critics, Philosophers and Their Critics Vol 8, Blackwell Publ., Oxford (UK) \/ Cambridge (MA), 1996, Ch 11, pp 231\u2013261."},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1014019225365","volume":"41","author":"G. Etesi","year":"2002","unstructured":"G. Etesi, I. N\u00e9meti: Non-Turing computations via Malament-Hogarth space-times, Int. J. Theor. Phys. 41 (2002) 341\u2013370, see also: http:\/\/arXiv.org\/abs\/gr-qc\/0104023 .","journal-title":"Int. J. Theor. Phys."},{"issue":"2","key":"24_CR8","doi-asserted-by":"publisher","first-page":"567","DOI":"10.2307\/2586556","volume":"65","author":"J.D. Hamkins","year":"2000","unstructured":"J.D. Hamkins, A. Lewis: Infinite time Turing machines, Journal of Symbolic Logic Vol. 65,2, pp. 567\u20136\u20134, 2000.","journal-title":"Journal of Symbolic Logic"},{"key":"24_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04880-1","volume-title":"The complexity theory companion","author":"L.A. Hemaspaandra","year":"2002","unstructured":"L.A. Hemaspaandra, M. Ogihara: The complexity theory companion, Springer-Verlag, Berlin, 2002."},{"key":"24_CR10","first-page":"126","volume-title":"1994 Biennial Meeting of the Philosophy of Science Association (PSA 1994), Proceedings","author":"J. Hogarth","year":"1994","unstructured":"J. Hogarth: Non-Turing computers and non-Turing computability, in D. Hull, M. Forbes and R.M. Burian (eds.), 1994 Biennial Meeting of the Philosophy of Science Association (PSA 1994), Proceedings Vol. One, Philosophy of Science Association, East Lansing, 1994, pp 126\u2013138."},{"key":"24_CR11","volume-title":"Introduction to automata theory, languages and computation","author":"J. Hopcroft","year":"2000","unstructured":"J. Hopcroft, R. Motwani, and J.D. Ullman: Introduction to automata theory, languages and computation, 2nd Edition, Addison-Wesley, Reading, MA, 2000.","edition":"2nd Edition"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"R.M. Karp, R.J. Lipton: Some connections between non-uniform and uniform complexity classes, in Proc. 12th Annual ACM Symposium on the Theory of Computing (STOC\u201980), 1980, pp. 302\u2013309.","DOI":"10.1145\/800141.804678"},{"key":"24_CR13","unstructured":"J.D. Norton: What can we learn about ontology of space and time from the theory of relativity?, PhilSci Archive (http:\/\/philsci-archive.pitt.edu\/) , ID: PITT-PHIL-SCI00000138, 2001."},{"key":"24_CR14","volume-title":"Theory of recursive functions and effective computability","author":"H. Rogers Jr","year":"1967","unstructured":"H. RogersJr, Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967."},{"key":"24_CR15","first-page":"230","volume":"42-2","author":"A.M. Turing","year":"1936","unstructured":"A.M. Turing: On computable numbers, with an application to the Entscheidungsproblem, Proc. London Math. Soc., 42-2 (1936) 230\u2013265; A correction, ibid, 43 (1937), pp. 544\u2013546.","journal-title":"Proc. London Math. Soc."},{"issue":"45","key":"24_CR16","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1112\/plms\/s2-45.1.161","volume":"2","author":"A.M. Turing","year":"1939","unstructured":"A.M. Turing: Systems of logic based on ordinals, Proc. London Math. Soc. Series 2,45 (1939), pp. 161\u2013228.","journal-title":"Proc. London Math. Soc. Series"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"J. van Leeuwen, J. Wiedermann: The Turing machine paradigm in contemporary computing, in: B. Enquist and W. Schmidt (Eds.), Mathematics unlimited \u2014 2001 and beyond, Springer-Verlag, 2001, pp. 1139\u20131155.","DOI":"10.1007\/978-3-642-56478-9_59"},{"key":"24_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-45627-9_8","volume-title":"SOFSEM\u201901: Theory and Practice of Informatics","author":"J. Leeuwen van","year":"2001","unstructured":"J. van Leeuwen, J. Wiedermann: Beyond the Turing limit: evolving interactive systems, in: L. Pacholski, P. Ru\u017ei\u010dka (Eds.), SOFSEM\u201901: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics, Lecture Notes in Computer Science Vol. 2234, Springer-Verlag, Berlin, 2001, pp. 90\u2013109."},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1145\/253769.253801","volume":"40","author":"P. Wegner","year":"1997","unstructured":"P. Wegner: Why interaction is more powerful than algorithms, C. ACM 40, (1997) 315\u2013351.","journal-title":"C. ACM"},{"key":"24_CR20","series-title":"Lecture Notes in Artificial Intelligence","first-page":"55","volume-title":"Artificial Life 2001, 6th European Conference (ECAL 2001)","author":"J. Wiedermann","year":"2001","unstructured":"J. Wiedermann, J. vanLeeuwen: Emergence of super-Turing computing power in artificial living systems, in: J. Kelemen, P. Sos\u00edk (Eds.), Artificial Life 2001, 6th European Conference (ECAL 2001), Lecture Notes in Artificial Intelligence, Springer-Verlag, Berlin, 2001, pp. 55\u201365."},{"key":"24_CR21","unstructured":"L. Wischik:A formalisation of non-finite computation, dissertation submitted to the University of Cambridge towards the degree of Master of Philosophy, June 1997 (available at: http:\/\/www.wischik.com\/lu\/philosophy\/non-finite-computation.html )."}],"container-title":["Lecture Notes in Computer Science","Unconventional Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45833-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:07:14Z","timestamp":1556737634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45833-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540443117","9783540458333"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45833-6_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}