{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:35:52Z","timestamp":1725557752265},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135224"},{"type":"electronic","value":"9783642135231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13523-1_15","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T04:34:26Z","timestamp":1277267666000},"page":"127-139","source":"Crossref","is-referenced-by-count":1,"title":["A New Representation of Chaitin \u03a9 Number Based on Compressible Strings"],"prefix":"10.1007","author":[{"given":"Kohtaro","family":"Tadaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0304-3975(99)00159-0","volume":"255","author":"C.S. Calude","year":"2001","unstructured":"Calude, C.S., Hertling, P.H., Khoussainov, B., Wang, Y.: Recursively enumerable reals and Chaitin \u03a9 numbers. Theoret. Comput. Sci.\u00a0255, 125\u2013149 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR2","unstructured":"Calude, C.S., Hay, N.J., Stephan, F.C.: Representation of left-computable \u03b5-random reals, Research Report of CDMTCS, May 2009, p. 365 (2009), \n                    \n                      http:\/\/www.cs.auckland.ac.nz\/CDMTCS\/researchreports\/365cris.pdf"},{"key":"15_CR3","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1145\/321892.321894","volume":"22","author":"G.J. Chaitin","year":"1975","unstructured":"Chaitin, G.J.: A theory of program size formally identical to information theory. J. Assoc. Comput. Mach.\u00a022, 329\u2013340 (1975)","journal-title":"J. Assoc. Comput. Mach."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0898-1221(76)90016-X","volume":"2","author":"G.J. Chaitin","year":"1976","unstructured":"Chaitin, G.J.: Algorithmic entropy of sets. Computers & Mathematics with Applications\u00a02, 233\u2013245 (1976)","journal-title":"Computers & Mathematics with Applications"},{"key":"15_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608858","volume-title":"Algorithmic Information Theory","author":"G.J. Chaitin","year":"1987","unstructured":"Chaitin, G.J.: Algorithmic Information Theory. Cambridge University Press, Cambridge (1987)"},{"issue":"1","key":"15_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1137\/S0097539799357441","volume":"31","author":"A. Ku\u010dera","year":"2001","unstructured":"Ku\u010dera, A., Slaman, T.A.: Randomness and recursive enumerability. SIAM J. Comput.\u00a031(1), 199\u2013211 (2001)","journal-title":"SIAM J. Comput."},{"key":"15_CR7","unstructured":"Solovay, R.M.: Draft of a paper (or series of papers) on Chaitin\u2019s work... done for the most part during the period of September-December 1974. IBM Thomas J. Watson Research Center, Yorktown Heights, New York, 215 p. (1975) (unpublished manuscript)"},{"key":"15_CR8","doi-asserted-by":"crossref","first-page":"219","DOI":"10.14492\/hokmj\/1350911778","volume":"31","author":"K. Tadaki","year":"2002","unstructured":"Tadaki, K.: A generalization of Chaitin\u2019s halting probability \u03a9 and halting self-similar sets. Hokkaido Math. J.\u00a031, 219\u2013253 (2002)","journal-title":"Hokkaido Math. J."},{"key":"15_CR9","unstructured":"Tadaki, K.: A statistical mechanical interpretation of algorithmic information theory. In: Local Proceedings of Computability in Europe 2008 (CiE 2008), June 15-20, pp. 425\u2013434. University of Athens, Greece (2008), \n                    \n                      http:\/\/www.cs.swan.ac.uk\/cie08\/cie2008-local.pdf"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/978-3-642-03816-7_58","volume-title":"Mathematical Foundations of Computer Science 2009","author":"K. Tadaki","year":"2009","unstructured":"Tadaki, K.: Partial randomness and dimension of recursively enumerable reals. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol.\u00a05734, pp. 687\u2013699. Springer, Heidelberg (2009)"},{"key":"15_CR11","unstructured":"Tadaki, K.: Fixed points on partial randomness. In: Proceedings of the 6th Workshop on Fixed Points in Computer Science (FICS 2009), Coimbra, Portugal, September 12-13, pp. 100\u2013107 (2009), \n                    \n                      http:\/\/cs.ioc.ee\/fics09\/fics09proc.pdf"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Submitted to the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010)","author":"K. Tadaki","year":"2010","unstructured":"Tadaki, K.: One-wayness and two-wayness in algorithmic randomness. Submitted to the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010), Brno, Czech Republic, August 23-27. LNCS. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13523-1_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:06:13Z","timestamp":1619784373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13523-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135224","9783642135231"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13523-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}