{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:53:41Z","timestamp":1725753221984},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642449574"},{"type":"electronic","value":"9783642449581"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-44958-1_11","type":"book-chapter","created":{"date-parts":[[2013,10,22]],"date-time":"2013-10-22T14:54:01Z","timestamp":1382453641000},"page":"142-154","source":"Crossref","is-referenced-by-count":0,"title":["Algorithmic Information Theory and Computational Complexity"],"prefix":"10.1007","author":[{"given":"R\u016bsi\u0146\u0161","family":"Freivalds","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0016230","volume-title":"Mathematical Foundations of Computer Science 1986","author":"F.M. Ablayev","year":"1986","unstructured":"Ablayev, F.M., Freivalds, R.: Why sometimes probabilistic algorithms can be more effective. In: Wiedermann, J., Gruska, J., Rovan, B. (eds.) MFCS 1986. LNCS, vol.\u00a0233, pp. 1\u201314. Springer, Heidelberg (1986)"},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.tcs.2004.09.007","volume":"330","author":"H. Austinat","year":"2005","unstructured":"Austinat, H., Diekert, V., Hertrampf, U., Petersen, H.: Regular frequency computations. Theoretical Computer Science\u00a0330(1), 15\u201320 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"1\/2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0304-3975(95)00149-2","volume":"163","author":"R. Beigel","year":"1996","unstructured":"Beigel, R., Gasarch, W.I., Kinber, E.B.: Frequency computation and bounded queries. Theoretical Computer Science\u00a0163(1\/2), 177\u2013192 (1996)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jcss.1997.1508","volume":"55","author":"J. Case","year":"1997","unstructured":"Case, J., Kaufmann, S., Kinber, E.B., Kummer, M.: Learning recursive functions from approximations. Journal of Computer and System Sciences\u00a055(1), 183\u2013196 (1997)","journal-title":"Journal of Computer and System Sciences"},{"unstructured":"Degtev, A.N.: On (m,n)-computable sets. In: Moldavanskij, I., Gos, I. (eds.) Algebraic Systems, pp. 88\u201399. Universitet (1981)","key":"11_CR5"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/3-540-58201-0_100","volume-title":"Automata, Languages, and Programming","author":"R. Freivalds","year":"1994","unstructured":"Freivalds, R., Karpinski, M.: Lower Space Bounds for Randomized Computation. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol.\u00a0820, pp. 580\u2013592. Springer, Heidelberg (1994)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/3-540-60084-1_73","volume-title":"Automata, Languages and Programming","author":"R. Freivalds","year":"1995","unstructured":"Freivalds, R., Karpinski, M.: Lower Time Bounds for Randomized Computation. In: F\u00fcl\u00f6p, Z. (ed.) ICALP 1995. LNCS, vol.\u00a0944, pp. 183\u2013195. Springer, Heidelberg (1995)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/BFb0019368","volume-title":"Baltic Computer Science","author":"R. Freivalds","year":"1991","unstructured":"Freivalds, R.: Complexity of probabilistic versus deterministic automata. In: Barzdins, J., Bjorner, D. (eds.) Baltic Computer Science. LNCS, vol.\u00a0502, pp. 565\u2013613. Springer, Heidelberg (1991)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-49477-4_6","volume-title":"SOFSEM \u201998: Theory and Practice of Informatics","author":"R. Freivalds","year":"1998","unstructured":"Freivalds, R.: Models of computation, Riemann Hypothesis and classical mathematics. In: Rovan, B. (ed.) SOFSEM 1998. LNCS, vol.\u00a01521, pp. 89\u2013106. Springer, Heidelberg (1998)"},{"issue":"3","key":"11_CR10","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1142\/S0129054108005826","volume":"19","author":"R. Freivalds","year":"2008","unstructured":"Freivalds, R.: Non-constructive methods for finite probabilistic automata. International Journal of Foundations of Computer Science\u00a019(3), 565\u2013580 (2008)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"38-39","key":"11_CR11","doi-asserted-by":"publisher","first-page":"3436","DOI":"10.1016\/j.tcs.2010.05.038","volume":"411","author":"R. Freivalds","year":"2010","unstructured":"Freivalds, R.: Amount of nonconstructivity in finite automata. Theoretical Computer Science\u00a0411(38-39), 3436\u20133443 (2010)","journal-title":"Theoretical Computer Science"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-642-37064-9_26","volume-title":"Language and Automata Theory and Applications","author":"R. Freivalds","year":"2013","unstructured":"Freivalds, R., Zeugmann, T., Pogosyan, G.R.: On the Size Complexity of Deterministic Frequency Automata. In: Dediu, A.-H., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol.\u00a07810, pp. 287\u2013298. Springer, Heidelberg (2013)"},{"key":"11_CR13","volume-title":"The Mathematics of Coding Theory","author":"P. Garret","year":"2004","unstructured":"Garret, P.: The Mathematics of Coding Theory. Pearson Prentice Hall, Upper Saddle River (2004)"},{"unstructured":"Gurari, E.: An Introduction to the Theory of Computation, ch. 2.2. Computer Science Press, an imprint of E. H. Freeman (1989)","key":"11_CR14"},{"issue":"2","key":"11_CR15","doi-asserted-by":"publisher","first-page":"682","DOI":"10.2307\/2275300","volume":"57","author":"V. Harizanova","year":"1992","unstructured":"Harizanova, V., Kummer, M., Owings, J.: Frequency computations and the cardinality theorem. The Journal of Symbolic Logic\u00a057(2), 682\u2013687 (1992)","journal-title":"The Journal of Symbolic Logic"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1997.2666","volume":"139","author":"M. Hinrichs","year":"1997","unstructured":"Hinrichs, M., Wechsung, G.: Time bounded frequency computations. Information and Computation\u00a0139, 234\u2013257 (1997)","journal-title":"Information and Computation"},{"doi-asserted-by":"crossref","unstructured":"Ka\u0146eps, J., Freivalds, R.: Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines. In: Rovan, B. (ed.) MFCS 1990. LNCS, vol.\u00a0452, pp. 355\u2013361. Springer, Heidelberg (1990)","key":"11_CR17","DOI":"10.1007\/BFb0029629"},{"key":"11_CR18","first-page":"873","volume":"13","author":"E.B. Kinber","year":"1972","unstructured":"Kinber, E.B.: Frequency calculations of general recursive predicates and frequency enumeration of sets. Soviet Mathematics Doklady\u00a013, 873\u2013876 (1972)","journal-title":"Soviet Mathematics Doklady"},{"doi-asserted-by":"crossref","unstructured":"Kinber, E.B.: Frequency computations in finite automata. Kibernetika\u00a0(2), 7\u201315 (1976), Russian; English translation in Cybernetics 12, 179\u2013187 (1976)","key":"11_CR19","DOI":"10.1007\/BF01069884"},{"doi-asserted-by":"crossref","unstructured":"Kinber, E.B., Gasarch, W.I., Zeugmann, T., Pleszkoch, M.G., Smith, C.H.: Learning Via Queries With Teams and Anomalies. In: Proceedings of COLT 1990, pp. 327\u2013337 (1990)","key":"11_CR20","DOI":"10.1016\/B978-1-55860-146-8.50028-X"},{"key":"11_CR21","first-page":"1","volume":"1","author":"A.N. Kolmogorov","year":"1965","unstructured":"Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Problems in Information Transmission\u00a01, 1\u20137 (1965)","journal-title":"Problems in Information Transmission"},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0065-2458(08)60144-8","volume":"2","author":"R. McNaughton","year":"1961","unstructured":"McNaughton, R.: The Theory of Automata, a Survey. Advances in Computers\u00a02, 379\u2013421 (1961)","journal-title":"Advances in Computers"},{"issue":"3","key":"11_CR23","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"M.O. Rabin","year":"1963","unstructured":"Rabin, M.O.: Probabilistic automata. Information and Control\u00a06(3), 230\u2013245 (1963)","journal-title":"Information and Control"},{"issue":"2","key":"11_CR24","first-page":"115","volume":"3","author":"O. Michael","year":"1959","unstructured":"Michael, O.: Rabin and Dana Scott. Finite automata and their decision problems. IBM Journal of Research and Development\u00a03(2), 115\u2013125 (1959)","journal-title":"IBM Journal of Research and Development"},{"unstructured":"Rose, G.F.: An extended notion of computability. In: Abstracts of International Congress for Logic, Methodology and Philosophy of Science, p. 14 (1960)","key":"11_CR25"},{"issue":"2","key":"11_CR26","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/S0019-9958(64)90131-7","volume":"7","author":"R. Solomonoff","year":"1964","unstructured":"Solomonoff, R.: A Formal Theory of Inductive Inference, Part II. Information and Control\u00a07(2), 224\u2013254 (1964)","journal-title":"Information and Control"},{"unstructured":"Trakhtenbrot, B.A.: On the frequency computation of functions. Algebra i Logika\u00a02, 25\u201332 (1964) (Russian)","key":"11_CR27"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","first-page":"148","volume-title":"Mathematical Foundations of Computer Science 1975","author":"B.A. Trakhtenbrot","year":"1975","unstructured":"Trakhtenbrot, B.A.: Frequency Algorithms and Computations. In: Becvar, J. (ed.) MFCS 1975. LNCS, vol.\u00a032, pp. 148\u2013161. Springer, Heidelberg (1975)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-44958-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,31]],"date-time":"2019-07-31T02:47:28Z","timestamp":1564541248000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-44958-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642449574","9783642449581"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-44958-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}