{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:19Z","timestamp":1759638259301},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,2,14]],"date-time":"2009-02-14T00:00:00Z","timestamp":1234569600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1007\/s11047-009-9116-1","type":"journal-article","created":{"date-parts":[[2009,2,13]],"date-time":"2009-02-13T08:28:15Z","timestamp":1234513695000},"page":"493-498","source":"Crossref","is-referenced-by-count":2,"title":["A new problem for rule following"],"prefix":"10.1007","volume":"8","author":[{"given":"Mark","family":"Hogarth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,2,14]]},"reference":[{"key":"9116_CR1","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1093\/bjps\/52.4.671","volume":"52","author":"EB Davies","year":"2001","unstructured":"Davies EB (2001) Building infinite machines. Br J Philos Sci 52:582\u2013671","journal-title":"Br J Philos Sci"},{"key":"9116_CR2","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1086\/289716","volume":"5","author":"J Earman","year":"1993","unstructured":"Earman J, Norton J (1993) Forever is a day: supertasks in Pitowsky and Malament\u2013Hogarth spacetimes. Philos Sci 5:22\u201342","journal-title":"Philos Sci"},{"issue":"2","key":"9116_CR3","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1014019225365","volume":"41","author":"G Etesi","year":"2002","unstructured":"Etesi G, Nemeti I (2002) Non-Turing computations via Malament\u2013Hogarth space-times. Int J Theor Phys 41(2):341\u2013370","journal-title":"Int J Theor Phys"},{"key":"9116_CR20","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00682813","volume":"5","author":"M Hogarth","year":"1992","unstructured":"Hogarth M (1992) Does general relativity allow an observer to view eternity in a finite time? Found Phys Lett 5:173\u2013181","journal-title":"Found Phys Lett"},{"key":"9116_CR4","first-page":"126","volume-title":"PSA 1994","author":"M Hogarth","year":"1994","unstructured":"Hogarth M (1994) Non-Turing computers and non-Turing computability. In: Hull D, Forbes M, Okruhlik K (eds) PSA 1994, vol 1. Philosophy of Science Association, East Lansing, pp 126\u2013138"},{"key":"9116_CR5","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1093\/bjps\/55.4.681","volume":"55","author":"M Hogarth","year":"2004","unstructured":"Hogarth M (2004) Deciding arithmetic using SAD computers. Br J Philos Sci 55:681\u2013691","journal-title":"Br J Philos Sci"},{"key":"9116_CR6","unstructured":"Hogarth M (2009, forthcoming) Non-Turing computers are the new non-Euclidean geometries. Int J Unconv Comput"},{"key":"9116_CR7","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.amc.2005.09.075","volume":"178","author":"I Nemeti","year":"2006","unstructured":"Nemeti I, David Gy (2006) Relativistic computers and the Turing barrier. J Appl Math Comput 178:118\u2013142","journal-title":"J Appl Math Comput"},{"key":"9116_CR8","volume-title":"An essay on the foundations of geometry","author":"B Russell","year":"1996","unstructured":"Russell B (1996) An essay on the foundations of geometry. Routledge, London"},{"key":"9116_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-009-9909-1","volume-title":"Philosophy of geometry from Riemann to Poincar\u00e9","author":"R Torretti","year":"1978","unstructured":"Torretti R (1978) Philosophy of Geometry from Riemann to Poincar\u00e9. D. Reidel Publishing Co, Dordrecht"},{"key":"9116_CR10","volume-title":"Philosophical investigations","author":"L Wittgenstein","year":"1953","unstructured":"Wittgenstein L (1953) Philosophical investigations. Blackwell Publishing, Oxford"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-009-9116-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-009-9116-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-009-9116-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T03:46:04Z","timestamp":1559360764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-009-9116-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,14]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["9116"],"URL":"https:\/\/doi.org\/10.1007\/s11047-009-9116-1","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,14]]}}}