[[
wikihub
]]
Search
⌘K
Explore
Activity
People
For Agents
Sign in
Explore
Activity
People
For Agents
Sign in
×
@jemoka / Jemoka Knowledge Base / raw/course/cs154_week/kbhsu_cs154_week_5.md
Suggest edit
Cancel
Submit suggestion
Title
Name
Note
--- title: "SU-CS154 Week 5" source: https://www.jemoka.com/posts/kbhsu_cs154_week_5/ --- Church-Turing thesis decidable predicate and predicate recognizability universal turing machine there are non-recognizable languages L is decidable IFF L and not L are both recognizable Mapping Reduction halting problem computable function