The Cook-Berger problem -A guide to the
✍
Dag Normann
📂
Article
📅
2000
🏛
Elsevier Science
🌐
English
⚖ 495 KB
We show that to any computable, total functional \(\Phi\) of pure type 3 , there is a total \(P C F\)-definable functional \(\hat{\Phi} \sqsubseteq \Phi\). We discuss how the program for \(\hat{\Phi}\) can be viewed as the result of replacing non-deterministic constants in Plotkin's program for \(\P