AP CSP Halt or Not Game | Decidable vs Undecidable | Topic 3.18

Halt or Not

Some questions a program can always answer. Some no program can answer for every input, no matter how long you let it run

Problem 1 / 7 Correct: 0 Score: 0

How to play: read the problem, then decide whether an algorithm could be written that always gives the right yes-or-no answer for every possible input. You can test it on example inputs first. The tests are free, and they are also a trap: passing examples proves nothing at all, which is the thing this topic is about.

The problem

The tester0 examples tried

No examples tried yet.

Get in Touch

Whether you're a student, parent, or teacher — I'd love to hear from you.

Just want free AP CS resources?

Enter your email below and check the subscribe box — no message needed. Students get daily practice questions and study tips. Teachers get curriculum resources and teaching strategies.

Typically responds within 24 hours

Message Sent!

Thanks for reaching out. I'll get back to you within 24 hours.

🏫 Welcome, fellow educator!

I offer curriculum resources, practice materials, and study guides designed for AP CS teachers. Let me know what you're looking for — whether it's classroom materials, a guest speaker, or Teachers Pay Teachers resources.

Email

[email protected]

📚

Courses

AP CSA, CSP, & Cybersecurity

Response Time

Within 24 hours

Prefer email? Reach me directly at [email protected]