乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:51:31Z","timestamp":1676944291840},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T00:00:00Z","timestamp":1233705600000},"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":[[2009,11]]},"DOI":"10.1007\/s00224-009-9168-8","type":"journal-article","created":{"date-parts":[[2009,2,3]],"date-time":"2009-02-03T19:36:25Z","timestamp":1233689785000},"page":"756-772","source":"Crossref","is-referenced-by-count":2,"title":["Characterizing Programming Systems Allowing Program Self-Reference"],"prefix":"10.1007","volume":"45","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[]},{"suffix":"III","given":"Samuel E.","family":"Moelius","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,2,4]]},"reference":[{"key":"9168_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 314, 1093\u20131094 (2006)","journal-title":"Science"},{"key":"9168_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. J. ACM 14, 322\u2013336 (1967)","journal-title":"J. ACM"},{"key":"9168_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 314, 1118\u20131121 (2006)","journal-title":"Science"},{"key":"9168_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/malq.19910370702","volume":"37","author":"J. Case","year":"1991","unstructured":"Case, J.: Effectivizing inseparability. Z. Math. Log. Grundlagen Math. 37, 97\u2013111 (1991). Missing set complement signs in definitions in journal version corrected in version at \n http:\/\/www.cis.udel.edu\/~case\/papers\/mkdelta.ps","journal-title":"Z. Math. Log. Grundlagen Math."},{"key":"9168_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, 3\u201316 (1994)","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"9168_CR6","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\u2014Third 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\u2014Third Conference of Computability in Europe (CiE 2007). Lecture Notes in Computer Science, vol.\u00a04497, pp.\u00a0125\u2013134. Springer, Berlin (2007)"},{"key":"9168_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-74456-6_24","volume-title":"32nd International Symposium on Mathematical Foundations of Computer Science (MFCS\u201907)","author":"J. Case","year":"2007","unstructured":"Case, J., Moelius III, S.E.: Properties complementary to program self-reference. In: 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS\u201907). Lecture Notes in Computer Science, vol.\u00a04708, pp.\u00a0253\u2013263. Springer, Berlin (2007)"},{"issue":"1\u20132","key":"9168_CR8","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. Theor. Comput. Sci. 270(1\u20132), 287\u2013308 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"5816","key":"9168_CR9","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 315(5816), 1219\u20131220 (2007). A letter, including responses from C. Adami and from H. Lipson, V. Zykov, and J. Bongard","journal-title":"Science"},{"key":"9168_CR10","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. Z.\u00a0Math. Log. Grundlagen Math. 28, 463\u2013479 (1982)","journal-title":"Z.\u00a0Math. Log. Grundlagen Math."},{"key":"9168_CR11","unstructured":"Friedman, H.: [FOM] 305: Proofs of Godel\u2019s Second. Communication to the Foundations of Mathematics electronic mailing list (21 December 2006)"},{"key":"9168_CR12","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 Log. 36, 359\u2013369 (1997)","journal-title":"Algebra Log."},{"issue":"1","key":"9168_CR13","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. J. Symb. Log. 66(1), 357\u2013382 (2001)","journal-title":"J. Symb. Log."},{"key":"9168_CR14","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(80)90017-1","volume":"11","author":"D. Kozen","year":"1980","unstructured":"Kozen, D.: Indexings of subrecursive classes. Theor. Comput. Sci. 11, 277\u2013301 (1980)","journal-title":"Theor. Comput. Sci."},{"key":"9168_CR15","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":"9168_CR16","volume-title":"Mathematical Theory of Computation","author":"Z. Manna","year":"1974","unstructured":"Manna, Z.: Mathematical Theory of Computation. McGraw-Hill, New York (1974). Reprinted: Dover (2003)"},{"issue":"7","key":"9168_CR17","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. Commun. ACM 15(7), 528\u2013536 (1972)","journal-title":"Commun. ACM"},{"key":"9168_CR18","volume-title":"Introduction to Mathematical Logic","author":"E. Mendelson","year":"1997","unstructured":"Mendelson, E.: Introduction to Mathematical Logic, 4th. edn. Chapman & Hall, London (1997)","edition":"4"},{"key":"9168_CR19","unstructured":"Riccardi, G.: The independence of control structures in abstract programming systems. Ph.D. thesis, SUNY Buffalo (1980)"},{"key":"9168_CR20","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. J. Comput. Syst. Sci. 22, 107\u2013143 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"9168_CR21","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, 331\u2013341 (1958)","journal-title":"J. Symb. Log."},{"key":"9168_CR22","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":"9168_CR23","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. Lecture Notes in Computer Science, vol.\u00a0273. Springer, Berlin (1987)"},{"key":"9168_CR24","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)"},{"key":"9168_CR25","unstructured":"Smith, B.: Reflection and semantics in a procedural language. Technical report MIT-TR-272, MIT Laboratory for Computer Science (1982)"},{"issue":"4","key":"9168_CR26","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 J. Formal Log. 22(4), 357\u2013374 (1981)","journal-title":"Notre Dame J. Formal Log."},{"key":"9168_CR27","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":"9168_CR28","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","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. Lecture Notes in Artificial Intelligence, vol.\u00a0961, pp.\u00a0190\u2013258. Springer, Berlin (1995)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-009-9168-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-009-9168-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-009-9168-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-009-9168-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T02:52:44Z","timestamp":1581994364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-009-9168-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,4]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["9168"],"URL":"https:\/\/doi.org\/10.1007\/s00224-009-9168-8","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,4]]}}}