MathDB

1

Part of 1976 Miklós Schweitzer

Problems(1)

Miklos Schweitzer 1976_1

Source: Set Theory

12/30/2008
Assume that R R, a recursive, binary relation on N \mathbb{N} (the set of natural numbers), orders N \mathbb{N} into type ω \omega. Show that if f(n) f(n) is the n nth element of this order, then f f is not necessarily recursive. L. Posa
advanced fieldsadvanced fields unsolvedDiscrete Mathematicscomputer sciencecollege contestsMiklos Schweitzer