MathDB
Miklos Schweitzer 1976_1

Source: Set Theory

December 30, 2008
advanced fieldsadvanced fields unsolvedDiscrete Mathematicscomputer sciencecollege contestsMiklos Schweitzer

Problem Statement

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
Back to ProblemsView on AoPS