{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T11:25:55Z","timestamp":1751887555144},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,12,7]],"date-time":"2011-12-07T00:00:00Z","timestamp":1323216000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s00224-011-9372-1","type":"journal-article","created":{"date-parts":[[2011,12,6]],"date-time":"2011-12-06T07:31:37Z","timestamp":1323156697000},"page":"22-49","source":"Crossref","is-referenced-by-count":3,"title":["Program Self-Reference in Constructive Scott Subdomains"],"prefix":"10.1007","volume":"51","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[]},{"suffix":"III","given":"Samuel E.","family":"Moelius","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,12,7]]},"reference":[{"key":"9372_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-1-4615-0755-0_2","volume-title":"Computability and Models","author":"S. Badaev","year":"2003","unstructured":"Badaev, S., Goncharov, S., Sorbi, A.: Completeness and universality of arithmetical numberings. In: Computability and Models, pp. 11\u201344. Springer, Berlin (2003)"},{"issue":"2","key":"9372_CR2","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"Blum, M.: A\u00a0machine independent theory of the complexity of recursive functions. J. ACM 14(2), 322\u2013336 (1967)","journal-title":"J. ACM"},{"issue":"3","key":"9372_CR3","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1145\/321650.321651","volume":"18","author":"J. Case","year":"1971","unstructured":"Case, J.: A\u00a0note on the degrees of self-describing Turing machines. J. ACM 18(3), 329\u2013338 (1971)","journal-title":"J. ACM"},{"issue":"1","key":"9372_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF01761704","volume":"8","author":"J. Case","year":"1974","unstructured":"Case, J.: Periodicity in generations of automata. Math. Syst. Theory 8(1), 15\u201332 (1974)","journal-title":"Math. Syst. Theory"},{"issue":"1","key":"9372_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/09528139408953778","volume":"6","author":"J. Case","year":"1994","unstructured":"Case, J.: Infinitary self-reference in learning theory. J. Exp. Theor. Artif. Intell. 6(1), 3\u201316 (1994)","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"9372_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/978-3-642-03409-1_5","volume-title":"FCT\u201909: Proc. of 17th International Symposium on Fundamentals of Computation Theory","author":"J. Case","year":"2009","unstructured":"Case, J., Moelius, S.: Independence results for n-ary recursion theorems. In: FCT\u201909: Proc. of 17th International Symposium on Fundamentals of Computation Theory. Lecture Notes in Computer Science, vol. 5699, pp. 38\u201349 (2009)"},{"key":"9372_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/978-3-642-03073-4_10","volume-title":"CiE\u201909: Proc. of Fifth Conference of Computability in Europe","author":"J. Case","year":"2009","unstructured":"Case, J., Moelius, S.: Program self-reference in constructive Scott subdomains. In: CiE\u201909: Proc. of Fifth Conference of Computability in Europe. Lecture Notes in Computer Science, vol. 5635, pp. 89\u201398 (2009)"},{"key":"9372_CR8","volume-title":"Theory of Numberings","author":"Y.L. Ershov","year":"1977","unstructured":"Ershov, Y.L.: Theory of Numberings. Nauka, Moscow (1977). In Russian"},{"key":"9372_CR9","volume-title":"G\u00f6del, Escher, Bach: An Eternal Golden Braid","author":"D.R. Hofstadter","year":"1979","unstructured":"Hofstadter, D.R.: G\u00f6del, Escher, Bach: An Eternal Golden Braid (1979). Basic Books"},{"key":"9372_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/978-3-642-03073-4_28","volume-title":"CiE\u201909: Proc. of Fifth Conference of Computability in Europe","author":"S. Jain","year":"2009","unstructured":"Jain, S., Stephan, F., Teutsch, J.: Index sets and universal numberings. In: CiE\u201909: Proc. of Fifth Conference of Computability in Europe. Lecture Notes in Computer Science, vol. 5635, pp. 270\u2013279 (2009)"},{"key":"9372_CR11","first-page":"155","volume-title":"Proc. of the Symposium on Mathematical Theory of Automata","author":"C.Y. Lee","year":"1963","unstructured":"Lee, C.Y.: A Turing machine which prints its own code script. In: Proc. of the Symposium on Mathematical Theory of Automata, pp. 155\u2013164 (1963)"},{"key":"9372_CR12","volume-title":"An Introduction to the General Theory of Algorithms","author":"M. Machtey","year":"1978","unstructured":"Machtey, M., Young, P.: An Introduction to the General Theory of Algorithms. North Holland, Amsterdam (1978)"},{"issue":"1","key":"9372_CR13","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1137\/0207003","volume":"7","author":"M. Machtey","year":"1978","unstructured":"Machtey, M., Winklmann, K., Young, P.: Simple G\u00f6del numberings, isomorphisms, and programming properties. SIAM J. Comput. 7(1), 39\u201360 (1978)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9372_CR14","first-page":"3","volume":"16","author":"A.I. Mal\u2019tsev","year":"1961","unstructured":"Mal\u2019tsev, A.I.: Constructive algebras. Usp. Mat. Nauk 16(3), 3\u201360 (1961). In Russian","journal-title":"Usp. Mat. Nauk"},{"issue":"2","key":"9372_CR15","first-page":"4","volume":"2","author":"A.I. Mal\u2019tsev","year":"1963","unstructured":"Mal\u2019tsev, A.I.: Sets with complete numberings. Algebra Log. 2(2), 4\u201329 (1963). In Russian","journal-title":"Algebra Log."},{"key":"9372_CR16","doi-asserted-by":"crossref","unstructured":"Moore, K.: MIME (Multipurpose Internet Mail Extensions) Part Three: Message Header Extensions for Non-ASCII Text (1996). RFC2047","DOI":"10.17487\/rfc2047"},{"key":"9372_CR17","volume-title":"The Ways of Paradox and Other Essays","author":"W.V. Quine","year":"1966","unstructured":"Quine, W.V.: The Ways of Paradox and Other Essays (1966). Random House. Reprinted, Harvard University Press (1976)"},{"key":"9372_CR18","unstructured":"Riccardi, G.: The independence of control structures in abstract programming systems. PhD thesis, SUNY Buffalo (1980)"},{"issue":"3","key":"9372_CR19","doi-asserted-by":"publisher","first-page":"331","DOI":"10.2307\/2964292","volume":"23","author":"H. Rogers","year":"1958","unstructured":"Rogers, H.: G\u00f6del numberings of partial recursive functions. J. Symb. Log. 23(3), 331\u2013341 (1958)","journal-title":"J. Symb. Log."},{"key":"9372_CR20","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw Hill, New York (1967). Reprinted, MIT Press, 1987"},{"key":"9372_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-18253-5","volume-title":"A\u00a0Connotational Theory of Program Structure","author":"J. Royer","year":"1987","unstructured":"Royer, J.: A\u00a0Connotational Theory of Program Structure. Lecture Notes in Computer Science, vol.\u00a0273. Springer, Berlin (1987)"},{"issue":"1","key":"9372_CR22","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/0890-5401(90)90032-D","volume":"84","author":"D. Spreen","year":"1990","unstructured":"Spreen, D.: Computable one-to-one enumerations of effective domains. Inf. Comput. 84(1), 26\u201346 (1990)","journal-title":"Inf. Comput."},{"issue":"1","key":"9372_CR23","doi-asserted-by":"publisher","first-page":"185","DOI":"10.2307\/2586596","volume":"63","author":"D. Spreen","year":"1998","unstructured":"Spreen, D.: On effective topological spaces. J. Symb. Log. 63(1), 185\u2013221 (1998)","journal-title":"J. Symb. Log."},{"key":"9372_CR24","doi-asserted-by":"crossref","unstructured":"Spreen, D.: On domains witnessing increase in information. Applied General Topology 1(1) (2000)","DOI":"10.4995\/agt.2000.13640"},{"key":"9372_CR25","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1017\/CBO9780511546464.015","volume-title":"Logic Colloquium 2005","author":"D. Spreen","year":"2007","unstructured":"Spreen, D.: On some problems in computable topology. In: Logic Colloquium 2005, pp. 221\u2013254. Cambridge University Press, Cambridge (2007)"},{"key":"9372_CR26","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139166386","volume-title":"Mathematical Theory of Domains","author":"V. Stoltenberg-Hansen","year":"1994","unstructured":"Stoltenberg-Hansen, V., Lindstr\u00f6m, I., Griffor, E.R.: Mathematical Theory of Domains. Cambridge University Press, Cambridge (1994)"},{"key":"9372_CR27","first-page":"165","volume-title":"Proc. of the Symposium on Mathematical Theory of Automata","author":"J.M. Thatcher","year":"1963","unstructured":"Thatcher, J.M.: The construction of a self-describing Turing machine. In: Proc. of the Symposium on Mathematical Theory of Automata, pp. 165\u2013171 (1963)"},{"key":"9372_CR28","unstructured":"Thompson, G.P.: The Quine Page (1999). http:\/\/www.nyx.net\/~gthompso\/quine.htm"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9372-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-011-9372-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9372-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9372-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,28]],"date-time":"2020-06-28T08:28:19Z","timestamp":1593332899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-011-9372-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,7]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["9372"],"URL":"https:\/\/doi.org\/10.1007\/s00224-011-9372-1","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,7]]}}}