{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T06:21:18Z","timestamp":1784528478168,"version":"3.55.0"},"reference-count":8,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2014,1,15]],"date-time":"2014-01-15T00:00:00Z","timestamp":1389744000000},"content-version":"unspecified","delay-in-days":3058,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Bull. symb. log."],"published-print":{"date-parts":[[2005,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We define the notion of<jats:italic>ordinal computability<\/jats:italic>by generalizing standard T<jats:sc>uring<\/jats:sc>computability on tapes of length \u03c9 to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ordinal computable from a finite set of ordinal parameters if and only if it is an element of G<jats:sc>\u00f6del's<\/jats:sc>constructible universe<jats:italic>L<\/jats:italic>. This characterization can be used to prove the generalized continuum hypothesis in<jats:italic>L<\/jats:italic>.<\/jats:p>","DOI":"10.2178\/bsl\/1122038993","type":"journal-article","created":{"date-parts":[[2005,7,22]],"date-time":"2005-07-22T18:51:08Z","timestamp":1122058268000},"page":"377-397","source":"Crossref","is-referenced-by-count":59,"title":["Turing Computations On Ordinals"],"prefix":"10.1017","volume":"11","author":[{"given":"Peter","family":"Koepke","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2014,1,15]]},"reference":[{"key":"S1079898600003127_ref002","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-21723-8"},{"key":"S1079898600003127_ref003","doi-asserted-by":"crossref","DOI":"10.1515\/9781400881635","volume-title":"The consistency of the continuum hypothesis","volume":"3","author":"G\u00f6del","year":"1940"},{"key":"S1079898600003127_ref008","unstructured":"Silver Jack H. , How to eliminate the fine structure from the work of Jensen, handwritten manuscript, 197?"},{"key":"S1079898600003127_ref006","unstructured":"Richardson Thomas Lloyd , Silver machine approach to the constructible universe, Ph.D. thesis, University of California, Berkeley, 1979."},{"key":"S1079898600003127_ref001","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19600060105"},{"key":"S1079898600003127_ref004","doi-asserted-by":"publisher","DOI":"10.2307\/2586556"},{"key":"S1079898600003127_ref005","doi-asserted-by":"publisher","DOI":"10.1016\/0003-4843(72)90001-0"},{"key":"S1079898600003127_ref007","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12013-2"}],"container-title":["Bulletin of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1079898600003127","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T09:23:31Z","timestamp":1586337811000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1079898600003127\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["S1079898600003127"],"URL":"https:\/\/doi.org\/10.2178\/bsl\/1122038993","relation":{},"ISSN":["1079-8986","1943-5894"],"issn-type":[{"value":"1079-8986","type":"print"},{"value":"1943-5894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,9]]}}}