Reputation
Next privilege 50 Rep.
Comment everywhere
Badges
6
Newest
 Tumbleweed
Impact
~564 people reached

  • 0 posts edited
  • 0 helpful flags
  • 3 votes cast
Jan
6
comment Proof that an inverse of a possibly noncomputable function is possibly not decidable
About the first one: that's just what I meant, it's finite in either case (it doesn't depend on f's definition).
Jan
6
comment Proof that an inverse of a possibly noncomputable function is possibly not decidable
Yes, that was me. Well, I guess the answer(that f^-1 could just give me anything) just seemed a bit too "obvious" to me :) Thanks anyways.