{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:28Z","timestamp":1725488968795},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","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-74456-6_24","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T03:29:48Z","timestamp":1187062188000},"page":"253-263","source":"Crossref","is-referenced-by-count":2,"title":["Properties Complementary to Program Self-reference"],"prefix":"10.1007","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[]},{"suffix":"III","given":"Samuel E.","family":"Moelius","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_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":"24_CR2","series-title":"Lecture Notes in Computer Science","first-page":"119","volume-title":"Logic at Botik \u201989","author":"T. Amtoft","year":"1989","unstructured":"Amtoft, T., Nikolajsen, T., Tr\u00e4ff, J.L., Jones, N.: Experiments with implementations of two theoretical constructions. In: Meyer, A.R., Taitslin, M.A. (eds.) Logic at Botik 1989. LNCS, vol.\u00a0363, pp. 119\u2013133. Springer, Heidelberg (1989)"},{"key":"24_CR3","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":"24_CR4","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0019-9958(67)90546-3","volume":"11","author":"M. Blum","year":"1967","unstructured":"Blum, M.: On the size of machines. Information and Control\u00a011, 257\u2013265 (1967)","journal-title":"Information and Control"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Computation and Logic in the Real World - Third Conference of Computability in Europe (CiE 2007)","author":"G. Bonfante","year":"2007","unstructured":"Bonfante, G., Kaczmarek, M., Marion, J.-Y.: A classification of viruses through recursion theorems. In: Computation and Logic in the Real World - Third Conference of Computability in Europe (CiE 2007). LNCS, vol.\u00a04497, Springer, Berlin (2007)"},{"key":"24_CR6","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":"24_CR7","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. Mathematical Systems Theory\u00a08, 15\u201332 (1974)","journal-title":"Mathematical Systems Theory"},{"key":"24_CR8","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"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/978-3-540-73001-9_13","volume-title":"Computation and Logic in the Real World - Third Conference of Computability in Europe (CiE 2007)","author":"J. Case","year":"2007","unstructured":"Case, J., Moelius III, S.E.: Characterizing programming systems allowing program self-reference. In: Computation and Logic in the Real World - Third Conference of Computability in Europe (CiE 2007). LNCS, vol.\u00a04497, pp. 125\u2013134. Springer, Berlin (2007)"},{"unstructured":"Case, J., Moelius III, S.E.: Properties complementary to program self-reference (expanded version). Technical report, University of Delaware (2007), Available at \n                    \n                      http:\/\/www.cis.udel.edu\/~moelius\/publications","key":"24_CR10"},{"issue":"1-2","key":"24_CR11","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"},{"issue":"5816","key":"24_CR12","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1126\/science.315.5816.1219b","volume":"315","author":"R. Conduit","year":"2007","unstructured":"Conduit, R.: To sleep, perchance to dream. Science\u00a0315(5816), 1219\u20131220 (2007), A letter, including responses from C. Adami and from Lipson, H., Zykov, V., Bongard, J","journal-title":"Science"},{"unstructured":"Friedman, H.: [FOM] 305:Proofs of Godel\u2019s Second. Communication to the Foundations of Mathematics electronic mailing list (December 21, 2006)","key":"24_CR13"},{"issue":"1","key":"24_CR14","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"},{"doi-asserted-by":"crossref","unstructured":"Jones, N.: Computer implementation and applications of Kleene\u2019s s-m-n and recursion theorems. In: Moschovakis, Y. (ed.) Logic From Computer Science. Mathematical Science Research Institute Publications, vol.\u00a021, pp. 243\u2013263. Springer, Heidelberg (1992)","key":"24_CR15","DOI":"10.1007\/978-1-4612-2822-6_9"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2267778","volume":"3","author":"S.C. Kleene","year":"1938","unstructured":"Kleene, S.C.: On notation for ordinal numbers. Journal of Symbolic Logic\u00a03, 150\u2013155 (1938)","journal-title":"Journal of Symbolic Logic"},{"key":"24_CR17","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 Journal on Computing\u00a07, 39\u201360 (1978)","journal-title":"SIAM Journal on Computing"},{"key":"24_CR18","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)"},{"unstructured":"Manna, Z.: Mathematical theory of computation. MacGraw-Hill (1974). Reprinted, Dover (2003)","key":"24_CR19"},{"issue":"7","key":"24_CR20","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1145\/361454.361460","volume":"15","author":"Z. Manna","year":"1972","unstructured":"Manna, Z., Vuillemin, J.: Fixpoint approach to the theory of computation. Communications of the ACM\u00a015(7), 528\u2013536 (1972)","journal-title":"Communications of the ACM"},{"unstructured":"Riccardi, G.: The Independence of Control Structures in Abstract Programming Systems. PhD thesis, SUNY Buffalo (1980)","key":"24_CR21"},{"key":"24_CR22","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":"24_CR23","doi-asserted-by":"crossref","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, 23:331\u2013341 (1958)","journal-title":"Journal of Symbolic Logic"},{"unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw Hill, New York (1967). Reprinted, MIT Press, Cambridge (1987)","key":"24_CR24"},{"key":"24_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-18253-5","volume-title":"A Connotational Theory of Program Structure","author":"J. Royer","year":"1987","unstructured":"Royer, J.: A Connotational Theory of Program Structure. LNCS, vol.\u00a0273. Springer, Heidelberg (1987)"},{"key":"24_CR26","series-title":"Progress in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0249-3","volume-title":"Subrecursive Programming Systems: Complexity and Succinctness","author":"J. Royer","year":"1994","unstructured":"Royer, J., Case, J.: Subrecursive Programming Systems: Complexity and Succinctness. Progress in Theoretical Computer Science. Birkh\u00e4user, Boston (1994)"},{"doi-asserted-by":"crossref","unstructured":"Smullyan, R.: Theory of formal systems. Annals of Mathematics Studies (1961)","key":"24_CR27","DOI":"10.1515\/9781400882007"},{"key":"24_CR28","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)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T15:41:17Z","timestamp":1580312477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540744559","9783540744566"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}