06 — NP-completeness and SAT: from Cook-Levin to real problems
Cook-Levin theorem: SAT is NP-complete. Reductions to 3-SAT, vertex cover, clique, hamiltonian path.…
02 — Computability: Church-Turing thesis
What computable means: Church-Turing thesis, equivalence between lambda calculus, partial recursive functions and TM.
What do you think about this article?
At a Glance
What computable means: Church-Turing thesis, equivalence between lambda calculus, partial recursive functions and TM.
Audit of your freelance profile
Score and specific recommendations on your public profile
Discuss this article in the community
Join the Telegram group to discuss with other developers, ask questions and share your experiences.
Did you like this article?
Explore other content on the blog or discover my projects
Commenti
Caricamento commenti...
Accedi per lasciare un commento