45 free lesson minutes · Start now, no credit card needed
Shiur Prati

Private Computability Theory lessons with AI

Computability Theory with a live private lesson: the teacher talks with you out loud and explains on a shared board, moving at your pace through a clear plan, lesson after lesson.

Live 1:1 lesson with an AI teacherDegree course final exam

Teacher: Noam

  • Course updated 11/2026
  • Hebrew, and 5 more languages
  • 4 levels
  • 7 lessons · about 4 hours of lessons

Computability Theory

Computability Theory with a live private lesson: the teacher talks with you out loud and explains on a shared board, moving at your pace through a clear plan, lesson after lesson.

7 lessons · 4 modules · Live private lesson with the teacher on the board

What you'll learn

  • Regular Languages and Finite Automata
  • Context-Free Languages
  • Computability: Turing Machines and Undecidability
  • Complexity and Exam Preparation

What's included

  • Live 1:1 lessons with an AI tutor on a shared board
  • 4 hours of live one-on-one lessons
  • 7 lessons on a shared board, each with a clear goal
  • Practice and a understanding check in every lesson
  • A summary after every lesson, saved in the history
  • Preparation for the Degree course final exam
  • A completion certificate for each level
  • Computer, tablet or phone
  • Hebrew, plus 5 more languages

Course plan

1 level · 4 modules · 7 lessons · 4 hr 20 min total

יסודותFoundations of the Theory of Computation4 modules • 7 lessons • 4 hr 20 min

Mapped to exam: מבחן סופי באוניברסיטה (מועד א) — אוטומטים ושפות פורמליות / חישוביות וסיבוכיות

  1. Regular Languages and Finite Automata3 lessons • 1 hr 50 min
    1. 1Deterministic Finite Automata and Regular LanguagesTrial lessonabout 35 min
    2. 2NFA, Regular Expressions and Closure Propertiesabout 35 min
    3. 3The Pumping Lemma: Proving Non-Regularityabout 40 min
  2. Context-Free Languages1 lesson • 35 min
    1. 4Context-Free Grammars and Pushdown Automataabout 35 min
  3. Computability: Turing Machines and Undecidability2 lessons • 1 hr 15 min
    1. 5Turing Machines, Decidable and Recognizable Languagesabout 35 min
    2. 6The Halting Problem and Mapping Reductionsabout 40 min
  4. Complexity and Exam Preparation1 lesson • 40 min
    1. 7P, NP, NP-Completeness and Exam Techniqueabout 40 min

What you need

  • No prior knowledge needed for beginner level: the teacher checks what you already know and starts from there
  • For higher levels: what you learned at the level before (you can skip it if you already know it)
  • A computer, tablet or phone with a microphone, and a browser

Who it's for

  • Adults: for work, study, an exam, or just curiosity
  • For anyone preparing for Degree course final exam

Exams and certifications

  • Degree course final exam
  • יסודות: מבחן סופי באוניברסיטה (מועד א) — אוטומטים ושפות פורמליות / חישוביות וסיבוכיות
  • Calculus

    with Noam

    Live 1:1 lesson with an AI teacherabout 28 hours48 lessons4 levelsCalculus 1/2 exam
  • Linear Algebra

    with Noam

    Live 1:1 lesson with an AI teacher4 levelsLinear Algebra exam
  • Discrete Math

    with Noam

    Live 1:1 lesson with an AI teacher4 levelsDiscrete Math exam
  • Statistics and Probability

    with Noam

    Live 1:1 lesson with an AI teacher4 levelsStatistics exam
  • Physics for students

    with Noam

    Live 1:1 lesson with an AI teacher4 levelsPhysics 1/2 exam
  • General Chemistry

    with Noa

    Live 1:1 lesson with an AI teacher4 levelsGeneral Chemistry exam
  • Biology for students

    with Noam

    Live 1:1 lesson with an AI teacher4 levelsBiology exam
  • Intro to Economics

    with Noa

    Live 1:1 lesson with an AI teacher4 levelsIntro to Economics exam
See all courses in Courses for students

Your teacher

NoamNoamAI private tutor, in a live lesson on a shared board

A private AI teacher who teaches in a live conversation: asks, listens, draws on the board, and lets you solve it yourself with hints. Remembers what you've learned and starts each lesson where you left off.

What's a lesson like?

  • Your child talks with the teacher out loud, like a video call, and asks about anything unclear.

  • The teacher explains, writes and draws on a shared board, and your child solves along on the same board.

  • Snap a photo of a worksheet or homework and work through it, one problem at a time.

  • Parents get a report: study time, what went well and what needs more practice.

Lesson rules

  • Just Learning

FAQ

How does a private Computability Theory lesson work?
Pick Computability Theory and a level, then talk with the teacher out loud. The teacher asks what you already know, explains, writes and draws on the board, and lets you solve on your own with hints until it's clear.
How long does the Computability Theory course take?
7 lessons of about 37 minutes at the first level, at your own pace. You can pause, go back, or skip what you already know.
Do I need prior knowledge?
Not for beginner level. At the start of the first lesson the teacher checks what you already know and adjusts the level, and you can jump straight to an advanced level.
How do I start for free?
Sign in with Google or a code sent to your email, enter your child's name and grade, and the lesson starts right away. Every family gets 45 free lesson minutes in any subject, counted by actual lesson time, with no credit card. Then choose a paid plan and cancel anytime.
What device do I need?
Any computer, tablet or phone with a browser and a microphone. You can also install the site as an app on your home screen.

Want to try it?

Sign in, enter your child's name and grade, and the lesson begins. 45 free lesson minutes, no credit card.

Start for free

Shiur Prati with AI: what it is and how it works

Computability TheoryThe first 45 minutes are free

Private lessonStart free