of the problems discussed till now have such fi nite certifi cates. For example, for the HP, to demonstrate that
a checking program indeed halts with algorithm A with input W, we may give a complete trace of all the
variables and sequence of statements executed by A on input W. We can check this certifi cate by simulating
the action of A and checking each step against the certifi cate. Note that such a certifi cate for an undecidable
problem is by necessity “one-way” certifi cate, that is, for either Yes or No answer.
If both kinds of certifi cates are available for all the inputs, then it is easy to see that ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.