Stoa
HomeAntiquityBusinessHumanitiesMathFeedPodcasts
Sign in
All courses· Math Logic
Course HomeAI AssistantQuizProblemsTrainerMini Project
Stoa/Library/Math Logic & Algorithms/Module III

Module III·3 articles·~18 min

Computability Theory

Turing machines, decidability, and the Church–Turing thesis

Make a podcast about this module

Pick voices and format — AI generates the episode

§ 01 — Articles

  • I
    Turing Machines and Computable Functions
    Article 1 of 3
    ~6 min
    Read →
  • II
    The Halting Problem and Undecidable Problems
    Article 2 of 3
    ~6 min
    Read →
  • III
    Complexity Theory: P vs NP
    Article 3 of 3
    ~6 min
    Read →

§ 02 — Practice

I
Take the quiz
Test what you've learned in this module.
II
Discuss with AI
An AI tutor that knows this module.