{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:53:50Z","timestamp":1725530030900},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642006586"},{"type":"electronic","value":"9783642006593"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00659-3_4","type":"book-chapter","created":{"date-parts":[[2009,4,6]],"date-time":"2009-04-06T21:57:56Z","timestamp":1239055076000},"page":"79-94","source":"Crossref","is-referenced-by-count":4,"title":["Information: The Algorithmic Paradigm"],"prefix":"10.1007","author":[{"given":"Cristian S.","family":"Calude","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Ambos-Spies, K., Calude, C.S., Merkle, W., Staiger, L.: On Universal Computably Enumerable Prefix Codes (in preparation)"},{"volume-title":"Language and Information: Selected Essays on Their Theory and Application","year":"1964","key":"4_CR2","unstructured":"Bar-Hillel, Y. (ed.): Language and Information: Selected Essays on Their Theory and Application. Addison-Wesley, Reading (1964)"},{"key":"4_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511895968","volume-title":"Information Flow: The Logic of Distributed Systems","author":"J. Barwise","year":"1997","unstructured":"Barwise, J., Seligman, J.: Information Flow: The Logic of Distributed Systems. Cambridge University Press, Cambridge (1997)"},{"key":"4_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04978-5","volume-title":"Information and Randomness: An Algorithmic Perspective","author":"C.S. Calude","year":"2002","unstructured":"Calude, C.S.: Information and Randomness: An Algorithmic Perspective, 2nd edn. Springer, Berlin (2002)","edition":"2"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0304-3975(01)00068-8","volume":"284","author":"C.S. Calude","year":"2002","unstructured":"Calude, C.S.: Chaitin \u03a9 numbers, Solovay machines and incompleteness. Theoret. Comput. Sci.\u00a0284, 269\u2013277 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR6","first-page":"1","volume":"10","author":"C.S. Calude","year":"2006","unstructured":"Calude, C.S., Calude, E., Dinneen, M.J.: A new measure of the difficulty of problems. Journal for Multiple-Valued Logic and Soft Computing\u00a010, 1\u201321 (2006)","journal-title":"Journal for Multiple-Valued Logic and Soft Computing"},{"key":"4_CR7","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., Khoussainov, B., Wang, Y.: Recursively enumerable reals and Chaitin \u03a9 numbers. Theoret. Comput. Sci.\u00a0255, 125\u2013149 (2001)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"4_CR8","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1142\/S0129054101000606","volume":"12","author":"C.S. Calude","year":"2001","unstructured":"Calude, C.S., Ishihara, H., Yamaguchi, T.: Minimal programs are almost optimal. International Journal of Foundations of Computer Science\u00a012(4), 479\u2013489 (2001)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.aam.2004.10.003","volume":"35","author":"C.S. Calude","year":"2005","unstructured":"Calude, C.S., J\u00fcrgensen, H.: Is complexity a source of incompleteness? Advances in Applied Mathematics\u00a035, 1\u201315 (2005)","journal-title":"Advances in Applied Mathematics"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"1718","DOI":"10.1016\/j.ic.2006.07.003","volume":"204","author":"C.S. Calude","year":"2006","unstructured":"Calude, C.S., Stay, M.A.: Natural halting probabilities, partial randomness, and Zeta functions. Information and Computation\u00a0204, 1718\u20131739 (2006)","journal-title":"Information and Computation"},{"issue":"7","key":"4_CR11","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1007\/s10773-005-7081-8","volume":"44","author":"C.S. Calude","year":"2005","unstructured":"Calude, C.S., Stay, M.A.: From Heisenberg to G\u00f6del via Chaitin. International Journal of Theoretical Physics\u00a044(7), 1053\u20131065 (2005)","journal-title":"International Journal of Theoretical Physics"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.aam.2007.01.001","volume":"40","author":"C.S. Calude","year":"2008","unstructured":"Calude, C.S., Stay, M.A.: Most programs stop quickly or never halt. Advances in Applied Mathematics\u00a040, 295\u2013308 (2008)","journal-title":"Advances in Applied Mathematics"},{"key":"4_CR13","doi-asserted-by":"publisher","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":"4_CR14","doi-asserted-by":"publisher","DOI":"10.1142\/1048","volume-title":"Information, Randomness and Incompleteness, Papers on Algorithmic Information Theory","author":"G.J. Chaitin","year":"1990","unstructured":"Chaitin, G.J.: Information, Randomness and Incompleteness, Papers on Algorithmic Information Theory, 2nd edn. World Scientific, Singapore (1990)","edition":"2"},{"key":"4_CR15","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)"},{"key":"4_CR16","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, New York (1991)"},{"key":"4_CR17","volume-title":"The Millennium Problems","author":"K.J. Devlin","year":"2002","unstructured":"Devlin, K.J.: The Millennium Problems. Basic Books, New York (2002)"},{"key":"4_CR18","volume-title":"Logic and Information","author":"K.J. Devlin","year":"1991","unstructured":"Devlin, K.J.: Logic and Information. Cambridge University Press, Cambridge (1991)"},{"issue":"1-2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1111\/1467-9973.00221","volume":"33","author":"L. Floridi","year":"2002","unstructured":"Floridi, L.: What is the philosophy of information? Metaphilosophy\u00a033(1-2), 123\u2013145 (2002)","journal-title":"Metaphilosophy"},{"key":"4_CR20","unstructured":"Hawking, S.W.: G\u00f6del and the End of Physics. Dirac Centennial Celebration, Cambridge, UK (July 2002), \n                    \n                      http:\/\/www.damtp.cam.ac.uk\/strtst\/dirac\/hawking\/"},{"key":"4_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0009-6","volume-title":"Information Algebras: Generic Structures for Inference","author":"J. Kohlas","year":"2003","unstructured":"Kohlas, J.: Information Algebras: Generic Structures for Inference. Springer, London (2003)"},{"issue":"1","key":"4_CR22","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":"4_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.2307\/2322189","volume":"92","author":"J.C. Lagarias","year":"1985","unstructured":"Lagarias, J.C.: The 3x\u2009+\u20091 problem and its generalizations. Amer. Math. Monthly\u00a092, 3\u201323 (1985)","journal-title":"Amer. Math. Monthly"},{"key":"4_CR24","volume-title":"Quantum Computation and Quantum Information","author":"M.A. Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"4_CR25","unstructured":"Oliveira e Silva, T.: Goldbach Conjecture verification, June 5 (2006), \n                    \n                      http:\/\/www.ieeta.pt\/~tos\/goldbach.html"},{"key":"4_CR26","unstructured":"Oliveira e Silva, T.: Computational verification of the 3x+1 conjecture, May 26 (2006), \n                    \n                      http:\/\/www.ieeta.pt\/~tos\/3x+1.html"},{"key":"4_CR27","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1002\/j.1538-7305.1948.tb00917.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell System Technical Journal\u00a027, 379\u2013423, 623\u2013656 (1948)","journal-title":"Bell System Technical Journal"},{"key":"4_CR28","volume-title":"The Mathematical Theory of Communication","author":"C.E. Shannon","year":"1949","unstructured":"Shannon, C.E., Weaver, W.: The Mathematical Theory of Communication. University of Illinois Press, Urbana (1949) (paperback edition 1963; special fiftieth anniversary edition in 1999)"},{"key":"4_CR29","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-1-4471-0751-4_21","volume-title":"Finite Versus Infinite. Contributions to an Eternal Dilemma","author":"R.M. Solovay","year":"2000","unstructured":"Solovay, R.M.: A version of \u03a9 for which ZFC can not predict a single bit. In: Calude, C.S., P\u0103un, G. (eds.) Finite Versus Infinite. Contributions to an Eternal Dilemma, pp. 323\u2013334. Springer, London (2000)"},{"key":"4_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0977-8","volume-title":"Information and Meaning: An Evolutionary Perspective","author":"T. Stonier","year":"1997","unstructured":"Stonier, T.: Information and Meaning: An Evolutionary Perspective. Springer, Heidelberg (1997)"},{"key":"4_CR31","unstructured":"http:\/\/www.claymath.org\/millennium\/Riemann_Hypothesis\/"}],"container-title":["Lecture Notes in Computer Science","Formal Theories of Information"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00659-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T05:29:19Z","timestamp":1551936559000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00659-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642006586","9783642006593"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00659-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}