Skip to content
College Subject Practice · College Year 2

Computability Theory practice questions — College Subject Practice · College Year 2 Computer Science

Practise computability theory with topic-based questions. Preview a sample, then start a short session.

See the question style before signup · Get instant feedback · Continue with focused practice

Try a sample question

Check your answer to see the explanation where one has been published.

Try this question
For Rice's theorem to apply and prove a property undecidable, the property must be:

1 sample question · No signup needed

Something unclear? Report this question.

2
How many distinct symbols does the tape alphabet of a Turing machine include that the input alphabet does not?
3
A language is called decidable (recursive) if there exists a Turing machine that:
Start a sample session

50 published questions available for this topic.