Solving Problems with Finite Test Sets

Every finite and every co-finite set of non-negative integers is decidable. This is true and it is not, depending on whether the set is given constructively. A similar constraint is applicable in language theory and many other fields. The constraint is usually understood and, hence, omitted.

[1]  V. S. Guba,et al.  Equivalence of infinite systems of equations in free groups and semigroups to finite subsystems , 1986 .

[2]  Dominique Perrin.  On the solution of Ehrenfeucht's conjecture , 1985, Bull. EATCS.

[3]  Richard P. Brent,et al.  On the zeros of the Riemann zeta function in the critical strip , 1979 .

[4]  Cristian S. Calude,et al.  Mathematics: Randomness everywhere , 1999, Nature.

[5]  F. Browder.  Mathematical developments arising from Hilbert problems , 1976 .

[6]  W. A. Light,et al.  A note on Goldbach's conjecture , 1980 .

[7]  Yuri Matiyasevich,et al.  Hilbert's tenth problem , 1993 .

[8]  Helmut Koch,et al.  Über die Anzahl der Primzahlen unter einer gegebenen Größe , 1986 .

[9]  Gregory J. Chaitin,et al.  The Unknowable , 1999, Nabokov and Indeterminacy.

[10]  Wojciech Rytter,et al.  Efficient constructions of test sets for regular and context-free languages , 1991, Theor. Comput. Sci..

[11]  Martin Gardner,et al.  Fractal music, hypercards and more , 1995, The Mathematical Gazette.

[12]  Cristian S. Calude,et al.  Is independence an exception? , 1994, Applied Mathematics and Computation.

[13]  GEORGE HENSLOW,et al.  Intellect in Brutes , 1879, Nature.

[14]  Wojciech Plandowski,et al.  Polynomial Size Test Sets for Context-Free Languages , 1995, J. Comput. Syst. Sci..

[15]  Emil L. Post.  Recursively enumerable sets of positive integers and their decision problems , 1944 .

[16]  H. Riesel.  Prime numbers and computer methods for factorization , 1985 .

[17]  Cristian S. Calude,et al.  Ehrenfeucht Test Set Theorem and Hilbert Basis Theorem: A Constructive Glimpse , 1989, MFCS.

[18]  M. Lothaire.  Combinatorics on words: Bibliography , 1997 .

[19]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[20]  Arto Salomaa.  The Ehrenfeucht conjecture: a proof for language theorists , 1985, Bull. EATCS.

[21]  T. Rado.  On non-computable functions , 1962 .

[22]  J. McKinsey.  Review: Emil L. Post, Recursively Enumerable Sets of Positive Integers and Their Decision Problems , 1945, Journal of Symbolic Logic.

[23]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[24]  Michael H. Albert,et al.  A Proof of Ehrenfeucht's Conjecture , 1985, Theor. Comput. Sci..

[25]  Cristian S. Calude.  Note on Ehrenfeucht's conjecture and Hilbert's basis theorem , 1986, Bull. EATCS.

[26]  Georg Friedrich Bernhard Riemann,et al.  Gesammelte mathematische Werke, wissenschaftlicher Nachlass und Nachträge - collected papers , 1990 .

[27]  Richard P. Brent,et al.  On the zeros of the Riemann zeta function in the critical strip III , 1985 .

[28]  A. K. Dewdney,et al.  New Turing Omnibus , 1993 .

[29]  Cristian S. Calude.  Theories of computational complexity , 1988 .

[30]  L. Dickson.  History of the Theory of Numbers , 1924, Nature.

[31]  J RieleteH.J.,et al.  On the zeros of the Riemann zeta function in the critical strip III , 1983 .