Shared flashcard

Software · L5 · Computability Theory

Sign in to clone

Turing machines, the Church–Turing thesis, the halting problem, many-one reducibility, and Rice's theorem.

by @openstemUpdated Software

We use privacy-friendly product analytics (no session recording, PII masked) to improve OpenStem. Load analytics? Privacy Policy