Fabian Fritz

30 reputation

	30 reputation	bio	website	none	visits	member for	1 year, 4 months
5 badges		location	Reutlingen, Germany		seen	Feb 21 at 7:40

12 Actions

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	awarded	Supporter
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.
Jan 6	accepted	Proof that an inverse of a possibly noncomputable function is possibly not decidable
Jan 6	asked	Proof that an inverse of a possibly noncomputable function is possibly not decidable
Oct 20	awarded	Editor
Oct 20	awarded	Scholar
Oct 20	revised	Prove that a formal language is infinite added 2 characters in body
Oct 20	accepted	Prove that a formal language is infinite
Oct 20	awarded	Student
Oct 20	asked	Prove that a formal language is infinite
Jan 8	awarded	Autobiographer