Undecidability

Описание к видео Undecidability

Turing-acceptable and undecidable

Undecidable languages has no decider: any TM that accepts � does not halt on some input string.

We will show that there exists is a language � which is Turing-acceptable and undecidable:

� is Turing-acceptable

�― is not Turing-acceptable

Комментарии

Информация по комментариям в разработке