295 reputation
311
bio website
location
age
visits member for 1 year, 9 months
seen Jun 6 at 20:58

10 kinds of people in the world, those who understand binary and those who don't.


Sep
28
awarded  Notable Question
Sep
24
awarded  Autobiographer
Jul
2
awarded  Curious
Mar
27
accepted Understanding the Pumping Lemma
Mar
16
awarded  Notable Question
Jan
25
awarded  Yearling
Nov
24
awarded  Popular Question
Oct
31
awarded  Popular Question
Oct
6
awarded  Popular Question
Mar
18
comment The following Post Correspondence Problem unsolvable?
+1, Thanks for the reply. Can you please explain how you got this?
Mar
17
asked The following Post Correspondence Problem unsolvable?
Mar
17
comment Why is showing a language is Turing recognizable trickier than showing Turing decidable?
I see what you mean by me not being to easily explain what it means proves that it is tricky...
Mar
17
accepted Why is showing a language is Turing recognizable trickier than showing Turing decidable?
Mar
17
comment Why is showing a language is Turing recognizable trickier than showing Turing decidable?
If A runs forever, then it hasn't found the string it was looking for yet, but it still might, sometime in the future, right? <---- This thought is what is confusing me.
Mar
17
revised Why is showing a language is Turing recognizable trickier than showing Turing decidable?
added 17 characters in body
Mar
17
comment Why is showing a language is Turing recognizable trickier than showing Turing decidable?
Thanks for the reply. But Turing Decidable guarantees that it will eventually come to a halt, even if it runs for an extremely long time. With Turing Recognizable, if it checks if a string is in A and doesn't find it for 1000 years, it still may come up a second after it 'gives up' and goes to Turing Machine B, so its not really tricky, it is just doing what it is supposed to do, which is run for as long as it needs to. Its hard for me to explain what I mean, but I still don't get why proving a Recognizable language is closed under some operation is 'tricky' when compared to the contrary...
Mar
17
asked Why is showing a language is Turing recognizable trickier than showing Turing decidable?
Mar
14
revised Showing the following language is not contex free
deleted 3 characters in body
Mar
14
asked Showing the following language is not contex free
Mar
14
accepted Sipser Pumping Lemma Clarification