Solving Problems with Finite Test Sets

@inproceedings{Calude2000SolvingPW,
  title={Solving Problems with Finite Test Sets},
  author={Cristian S. Calude and Helmut J{\"u}rgensen and Shane Legg},
  booktitle={Finite Versus Infinite},
  year={2000}
}
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. 
BETA

Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 48 REFERENCES

Chaitin: The Unknowable

G J.
  • Springer-Verlag, Singapore,
  • 1999
VIEW 1 EXCERPT

Chaitin: The Unknowable

G J.
  • Springer-Verlag, Singapore,
  • 1999
VIEW 1 EXCERPT

Zimand : Is independence an exception ?

H. Jürgensen C. Calude, M.
  • Nature
  • 1999

Zimand : Is independence an exception ?

H. Jürgensen C. Calude, M.
  • Nature
  • 1999

Bridging linguistics and computer science, via mathematics

S. Marcus
  • People and Ideas in Theoretical Computer Science
  • 1998
VIEW 1 EXCERPT

A note on the Goldbach conjecture

T. J. Forres, N. Hammond, S. Roe
  • J . Comput . System Sci .
  • 1995

Vaida : Ehrenfeucht test set theorem and Hilbert basis theorem : A constructive glimpse

D. C. Calude
  • Applied Mathematics and Computation
  • 1994

Dewdney: The New Turing Omnibus

A K.
  • 1993
VIEW 1 EXCERPT