{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:12:52Z","timestamp":1725487972005},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540730002"},{"type":"electronic","value":"9783540730019"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73001-9_13","type":"book-chapter","created":{"date-parts":[[2007,7,24]],"date-time":"2007-07-24T11:16:31Z","timestamp":1185275791000},"page":"125-134","source":"Crossref","is-referenced-by-count":3,"title":["Characterizing Programming Systems Allowing Program Self-reference"],"prefix":"10.1007","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel E.","family":"MoeliusIII","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1126\/science.1135929","volume":"314","author":"C. Adami","year":"2006","unstructured":"Adami, C.: What do robots dream of? Science\u00a0314, 1093\u20131094 (2006)","journal-title":"Science"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"Blum, M.: A machine independent theory of the complexity of recursive functions. Journal of the ACM\u00a014, 322\u2013336 (1967)","journal-title":"Journal of the ACM"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1126\/science.1133687","volume":"314","author":"J. Bongard","year":"2006","unstructured":"Bongard, J., Zykov, V., Lipson, H.: Resilient machines through continuous self-modeling. Science\u00a0314, 1118\u20131121 (2006)","journal-title":"Science"},{"key":"13_CR4","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. Journal of Experimental and Theoretical Artificial Intelligence\u00a06, 3\u201316 (1994)","journal-title":"Journal of Experimental and Theoretical Artificial Intelligence"},{"issue":"1-2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0304-3975(00)00385-6","volume":"270","author":"J. Case","year":"2002","unstructured":"Case, J., Jain, S., Suraj, M.: Control structures in hypothesis spaces: The influence on learning. Theoretical Computer Science\u00a0270(1-2), 287\u2013308 (2002)","journal-title":"Theoretical Computer Science"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1002\/malq.19820282708","volume":"28","author":"R. Freivalds","year":"1982","unstructured":"Freivalds, R., Kinber, E., Wiehagen, R.: Inductive inference and computable one-one numberings. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik\u00a028, 463\u2013479 (1982)","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF02671553","volume":"36","author":"S. Goncharov","year":"1997","unstructured":"Goncharov, S., Sorbi, A.: Generalized computable numberings and non-trivial Rogers semilattices. Algebra and Logic\u00a036, 359\u2013369 (1997)","journal-title":"Algebra and Logic"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"357","DOI":"10.2307\/2694927","volume":"66","author":"S. Jain","year":"2001","unstructured":"Jain, S., Nessel, J.: Some independence results for control structures in complete numberings. Journal of Symbolic Logic\u00a066(1), 357\u2013382 (2001)","journal-title":"Journal of Symbolic Logic"},{"key":"13_CR9","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, New York (1978)"},{"key":"13_CR10","unstructured":"Riccardi, G.: The Independence of Control Structures in Abstract Programming Systems. PhD thesis, SUNY Buffalo (1980)"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0022-0000(81)90024-6","volume":"22","author":"G. Riccardi","year":"1981","unstructured":"Riccardi, G.: The independence of control structures in abstract programming systems. Journal of Computer and System Sciences\u00a022, 107\u2013143 (1981)","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR12","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. Journal of Symbolic Logic\u00a023, 331\u2013341 (1958)","journal-title":"Journal of Symbolic Logic"},{"key":"13_CR13","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw Hill, New York, 1967. Reprinted, MIT Press (1987)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"A Connotational Theory of Program Structure","year":"1987","unstructured":"Royer, J.S. (ed.): A Connotational Theory of Program Structure. LNCS, vol.\u00a0273. Springer, Heidelberg (1987)"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Royer, J., Case, J.: Subrecursive Programming Systems: Complexity and Succinctness. Research monograph in Progress in Theoretical Computer Science. Birkh\u00e4user\u00a0Boston (1994)","DOI":"10.1007\/978-1-4612-0249-3"},{"issue":"4","key":"13_CR16","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1305\/ndjfl\/1093883515","volume":"22","author":"C. Smorynski","year":"1981","unstructured":"Smorynski, C.: Fifty years of self-reference in arithmetic. Notre Dame Journal of Formal Logic\u00a022(4), 357\u2013374 (1981)","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"13_CR17","series-title":"Foundations of Computing Series","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3054.001.0001","volume-title":"The Formal Semantics of Programming Languages: An Introduction","author":"G. Winskel","year":"1993","unstructured":"Winskel, G.: The Formal Semantics of Programming Languages: An Introduction. Foundations of Computing Series. MIT Press, Cambridge (1993)"},{"key":"13_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-60217-8_12","volume-title":"Algorithmic Learning for Knowledge-Based Systems","author":"T. Zeugmann","year":"1995","unstructured":"Zeugmann, T., Lange, S.: A guided tour across the boundaries of learning recursive languages. In: Jantke, K.P., Lange, S. (eds.) Algorithmic Learning for Knowledge-Based Systems. LNCS (LNAI), vol.\u00a0961, pp. 190\u2013258. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Computation and Logic in the Real World"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73001-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T05:36:15Z","timestamp":1587792975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73001-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540730002","9783540730019"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73001-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}