Given string hello, it will return hellohello since it repeats itself once and it can be any word. the b just means alphabet and the ”*” is regex for any number of them.
essentially have a function that finds the midpoint, and have states corresponiding to each symbol in the language. then check that the first letter and letter after midpoint match, and delete them. (if they dont match rejet). Then do that over again (youd need some logic to handle the empty in the middle) and just repeat until nothing is left or it rejects.
No because of selfstudy 3 if Lprime < L and L is computable, then Lprime doesnt need to be computable.
Lets say we have a language B (L) and a language A (Lprime), B is equal to every combination of letters Σ*. That means b computable, because we can just accept any word. And since A is a subset of B, but B is everything, we can make A be equal to any of the non computable languages for example the halting problem.
If you have 2 turring machines its really easy. If the first one accepts it then leads into the second one, which in itself can also accept. So any combination of two computable turing machines will always be computable since its literally just 2 machines in squence.
- that is not a compliment
- HALTING PROBLEMMM!!!!
