{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T12:06:49Z","timestamp":1725624409804},"publisher-location":"London","reference-count":35,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781852332518"},{"type":"electronic","value":"9781447107514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/978-1-4471-0751-4_4","type":"book-chapter","created":{"date-parts":[[2011,10,23]],"date-time":"2011-10-23T18:51:02Z","timestamp":1319395862000},"page":"39-52","source":"Crossref","is-referenced-by-count":3,"title":["Solving Problems with Finite Test Sets"],"prefix":"10.1007","author":[{"given":"Cristian S.","family":"Calude","sequence":"first","affiliation":[]},{"given":"Helmut","family":"J\u00fcrgensen","sequence":"additional","affiliation":[]},{"given":"Shane","family":"Legg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0304-3975(85)90066-0","volume":"41","author":"MH Albert","year":"1985","unstructured":"M. H. Albert, J. Lawrence, A proof of Ehrenfeucht\u2019s conjecture, Theoret. Comput. Sci., 41 (1985), 121\u2013123.","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR2","first-page":"307","volume-title":"Fractal Music, HyperCards, and More\u2026","author":"CH Bennett","year":"1992","unstructured":"C. H. Bennett, Chaitin\u2019s Omega, in Fractal Music, HyperCards, and More\u2026 (M. Gardner, ed.), W. H. Freeman, New York, 1992, 307\u2013319."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"1361","DOI":"10.1090\/S0025-5718-1979-0537983-2","volume":"33","author":"RP Brent","year":"1979","unstructured":"R. P. Brent, J. v. d. Lune, H. J. J. t. Riele, D. T. Winter, On the zeros of the Riemann zeta function in the critical strip I, Math. Comp., 33 (1979), 1361\u20131372.","journal-title":"Math. Comp."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"1361","DOI":"10.1090\/S0025-5718-1979-0537983-2","volume":"39","author":"RP Brent","year":"1979","unstructured":"R. P. Brent, J. v. d. Lune, H. J. J. t. Riele, D. T. Winter, On the zeros of the Riemann zeta function in the critical strip II, Math. Comp., 39 (1979), 1361\u20131372.","journal-title":"Math. Comp."},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"1361","DOI":"10.1090\/S0025-5718-1979-0537983-2","volume":"41","author":"RP Brent","year":"1979","unstructured":"R. P. Brent, J. v. d. Lune, H. J. J. t. Riele, D. T. Winter, On the zeros of the Riemann zeta function in the critical strip III, Math. Comp., 41 (1979), 1361\u20131372.","journal-title":"Math. Comp."},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"1361","DOI":"10.1090\/S0025-5718-1979-0537983-2","volume":"46","author":"RP Brent","year":"1979","unstructured":"R. P. Brent, J. v. d. Lune, H. J. J. t. Riele, D. T. Winter, On the zeros of the Riemann zeta function in the critical strip IV, Math. Comp., 46 (1979), 1361\u20131372.","journal-title":"Math. Comp."},{"key":"4_CR7","first-page":"18","volume":"29","author":"C Calude","year":"1986","unstructured":"C. Calude, Note on Ehrenfeucht\u2019s conjecture and Hilbert\u2019s basis theorem, Bull. EATCS, 29 (1986), 18\u201322.","journal-title":"Bull. EATCS"},{"key":"4_CR8","volume-title":"Theories of Computational Complexities","author":"C Calude","year":"1988","unstructured":"C. Calude, Theories of Computational Complexities, North-Holland, Amsterdam, 1988."},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1038\/22435","volume":"22","author":"CS Calude","year":"1999","unstructured":"C. S. Calude, G. J. Chaitin, Randomness everywhere. Nature, 400, 22 July (1999), 319\u2013320.","journal-title":"Nature"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0096-3003(94)90158-9","volume":"66","author":"C Calude","year":"1994","unstructured":"C. Calude, H. J\u00fcrgensen, M. Zimand, Is independence an exception? Applied Mathematics and Computation, 66 (1994), 63\u201376.","journal-title":"Applied Mathematics and Computation"},{"key":"4_CR11","first-page":"177","volume-title":"Lecture Notes in Computer Science 379","author":"C Calude","year":"1989","unstructured":"C. Calude, D. Vaida, Ehrenfeucht test set theorem and Hilbert basis theorem: A constructive glimpse, in Mathematical Foundations of Computer Science, 1989 (A. Kreczmar, G. Mirkowska, eds.), Lecture Notes in Computer Science\n                379, Springer-Verlag, Berlin, 1989, 177\u2013184."},{"key":"4_CR12","volume-title":"The Unknowable","author":"GJ Chaitin","year":"1999","unstructured":"G. J. Chaitin, The Unknowable, Springer-Verlag, Singapore, 1999."},{"key":"4_CR13","first-page":"329","volume-title":"Handbook of Formal Language Theory","author":"C Choffrut","year":"1987","unstructured":"C. Choffrut, J. Karhum\u00e4ki, Combinatorics on words, in Handbook of Formal Language Theory (G. Rozenberg, A. Salomaa, eds.), Vol. 1, Springer-Verlag, Berlin, 1987, 329\u2013438."},{"key":"4_CR14","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1090\/pspum\/028.2\/0432534","volume-title":"Mathematical Developments Arising from Hilbert Problems","author":"M Davis","year":"1976","unstructured":"M. Davis, Y. V. Matijasevi\u010d, J. Robinson, Hilbert\u2019s tenth problem. Diophantine equations: Positive aspects of a negative solution, in Mathematical Developments Arising from Hilbert Problems (F. E. Browder, ed.), American Mathematical Society, Providence, RI, 1976, 323\u2013378."},{"issue":"8","key":"4_CR15","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1038\/scientificamerican0884-19","volume":"251","author":"AK Dewdney","year":"1984","unstructured":"A. K. Dewdney, A computer trap for the busy beaver, the hardest-working Turing machine, Scientific American, 251(8) (1984), 19\u201323.","journal-title":"Scientific American"},{"key":"4_CR16","volume-title":"The New Turing Omnibus","author":"AK Dewdney","year":"1993","unstructured":"A. K. Dewdney, The New Turing Omnibus, Computer Science Press, New York, 1993."},{"key":"4_CR17","volume-title":"History of the Theory of Numbers","author":"LE Dickson","year":"1919","unstructured":"L. E. Dickson, History of the Theory of Numbers, Carnegie Institute, Washington, 1919, 1920, 1923, 3 volumes."},{"key":"4_CR18","first-page":"321","volume":"40","author":"VS Guba","year":"1986","unstructured":"V. S. Guba, The equivalence of infinite systems of equations in free groups and semigroups, Mat. Zametki, 40 (1986), 321\u2013324 (in Russian).","journal-title":"Mat. Zametki"},{"key":"4_CR19","unstructured":"G. H. Hardy, Goldbach\u2019s theorem, Mat. Tid. B, 1 (1922), 1\u201316. Reprinted in Collected Papers of G. H. Hardy vol. 1, Oxford University Press, Oxford, 1966, 545\u2013560."},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0304-3975(93)90325-N","volume":"116","author":"J Karhum\u00e4ki","year":"1993","unstructured":"J. Karhum\u00e4ki, W. Rytter, S. Jarominek, Efficient constructions of test sets for regular and context-free languages, Theoret. Comput. Sci., 116 (1993), 305\u2013316.","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1006\/jcss.1995.1002","volume":"50","author":"J Karhum\u00e4ki","year":"1995","unstructured":"J. Karhum\u00e4ki, W. Plandowski, W. Rytter, Polynomial size test sets for context-free languages, J. Comput. System Sci., 50 (1995), 11\u201319.","journal-title":"J. Comput. System Sci."},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/BF01933648","volume":"20","author":"WA Light","year":"1980","unstructured":"W. A. Light, T. J. Forres, N. Hammond, S. Roe, A note on the Goldbach conjecture, BIT, 20 (1980), 525.","journal-title":"BIT"},{"key":"4_CR23","first-page":"117","volume-title":"Hilbert\u2019s Tenth Problem","author":"YV Matijasevi\u010d","year":"1993","unstructured":"Y. V. Matijasevi\u010d, Hilbert\u2019s Tenth Problem, MIT Press, Cambridge, MA, 1993, 117\u2013122."},{"key":"4_CR24","first-page":"163","volume-title":"People and Ideas in Theoretical Computer Science (C","author":"S Marcus","year":"1998","unstructured":"S. Marcus, Bridging linguistics and computer science, via mathematics, in People and Ideas in Theoretical Computer Science (C. S. Calude, ed.), Springer-Verlag, Singapore, 1998, 163\u2013176."},{"key":"4_CR25","unstructured":"A. M. Odlyzko, Tables of zeros of the Riemann zeta function, \n                  http:\/\/www.research.att.com\/\n                  \n                amo\/zeta_tables\/index.html."},{"key":"4_CR26","volume-title":"Goldbach Conjecture","author":"C-T Pan","year":"1992","unstructured":"C.-T. Pan, Goldbach Conjecture, Science Press, Beijing, 1992."},{"key":"4_CR27","first-page":"68","volume":"27","author":"D Perrin","year":"1985","unstructured":"D. Perrin, On the solution of Ehrenfeucht\u2019s conjecture, Bull. EATCS, 27 (1985), 68\u201370.","journal-title":"Bull. EATCS"},{"key":"4_CR28","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1090\/S0002-9904-1944-08111-1","volume":"50","author":"EL Post","year":"1944","unstructured":"E. L. Post, Recursively enumerable sets of positive integers and their decision problems, Bull. (New Series) Amer. Math. Soc., 50 (1944), 284\u2013316.","journal-title":"Bull. (New Series) Amer. Math. Soc."},{"key":"4_CR29","first-page":"977","volume":"3","author":"T Rado","year":"1962","unstructured":"T. Rado, On non-computable numbers, Bell System Tech. J., 3 (1962), 977\u2013884.","journal-title":"Bell System Tech. J."},{"key":"4_CR30","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/978-3-663-10149-9","volume-title":"Gesammelte mathematische Werke und, wissenchaftlicher Nachla\u00df","author":"B Riemann","year":"1990","unstructured":"B. Riemann, \u00dcber die Anzahl der Primzahlen unter einer gegebenen Gr\u00f6\u00dfe, in Gesammelte mathematische Werke und, wissenchaftlicher Nachla\u00df, Springer-Verlag, Berlin, 1990, 177\u2013185."},{"key":"4_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0251-6","volume-title":"Prime Numbers and Computer Methods for Factorization","author":"H Riesel","year":"1994","unstructured":"H. Riesel, Prime Numbers and Computer Methods for Factorization, Birkh\u00e4user, Boston, second ed., 1994.","edition":"2"},{"key":"4_CR32","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H Rogers","year":"1967","unstructured":"H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967."},{"key":"4_CR33","first-page":"71","volume":"27","author":"A Salomaa","year":"1985","unstructured":"A. Salomaa, The Ehrenfeucht conjecture: A proof for language theorists, Bull. EATCS, 27 (1985), 71\u201382.","journal-title":"Bull. EATCS"},{"volume-title":"Goldbach Conjecture","year":"1984","key":"4_CR34","unstructured":"W. Yuan, ed., Goldbach Conjecture, World Scientific, Singapore, 1984."},{"key":"4_CR35","unstructured":"Names of large numbers and unsolved problems, \n                  http:\/\/www.smartpages.com\/faqs\/sci-math-faq\/unsolvedproblems\/faq\n                  \n                .html, December 1994."}],"container-title":["Finite Versus Infinite"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-0751-4_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T20:37:40Z","timestamp":1619815060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-0751-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9781852332518","9781447107514"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-0751-4_4","relation":{},"subject":[],"published":{"date-parts":[[2000]]}}}