Past exam of the mathematics course of the University of Cambridge / 2026 / ii / Paper 4 / 4I / a

Table of contents
- Solution a

Solution

Run the algorithms for

f (n)

and

g (n)

and output their XOR. Closure of computable functions under composition makes

f + g

computable.

 Ancestors (10)

 View article source

 Discussion (0)

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic Create my own version