It isn't omnipotent, and that's where we hit the most profound wall in computer science.
S
speaker_5HOST
23:57
The textbook details the Scott Curry undecidability theorem.
S
speaker_4HOST
24:01
Undecidability.
S
speaker_5HOST
24:02
Yeah.
S
speaker_5HOST
24:02
This builds directly on Church's nineteen thirty-six work on the Entscheidungsproblem, or the decision problem.
We value your privacy
We use cookies to understand how you use our platform and to improve your experience. Click “Accept All” to consent, or “Decline non-essential” to opt out of non-essential cookies. Read our Privacy Policy.