Which language is decidable

47 Views Asked by At

Just been at the Math-exam. One question I was really unsure about, was this question - so I didn't answer it, as you get minus point if the answer is wrong. Does somebody know, what the right answer is for this problem - it made me crazy in the exam.

enter image description here

1

There are 1 best solutions below

0
On

It’s not my field, but I think that the first one is decidable. You feed $w$ to a Turing machine that both runs a universal Turing machine on the input $w$ and records all system configurations of that simulation of the ATM $w$ until either the simulated machine uses more than four million tape cells, or it repeats a configuration. In the first case it rejects $w$, and in the second case it accepts $w$. Since there are only finitely many system configurations using at most four million tape cells, this is possible.