Notes on Cambridge Maths

Something looks off?

The button will add this page to my log of things to fix. Use it for broken links, equations not rendering correctly, etc.
Submit other issues on GitHub.

Truncation of Register Machine

Let be a Register Machine and
We define the following sets , ,

Proposition

These sets are computable.

Proof

Only prove for last one, because it is the most complicated.

Something looks off?

The button will add this page to my log of things to fix. Use it for broken links, equations not rendering correctly, etc.
Submit other issues on GitHub.

Graph View

Backlinks