any injective recursive function inverts the order of infinitelymany numbers
in [Logic]
|
Prev: _recalibrated_ Boltzman's constant * gravitational constant = Planck's constant #547 Correcting Math
Next: Unrelenting Time
From: Jonny on 29 Mar 2010 16:05 Dear all, I'm struggling with an exercise on recursion theory. I'm trying to show that for any injective recursive function f there are infinitely many numbers whose order is inverted by f such that m<n but f(n)<f(m). I'd be grateful for any hint, or reference. Best |