Past exam of the mathematics course of the University of Cambridge / 2018 / ii / Paper 4 / 4G / b

Table of contents
- Solution b

Solution

By the S-m-n theorem, there is a total recursive function

h

such that

f_{h (x), 1} (y) ≃ g (x, y)

for all

x, y

. Apply the recursion theorem to

h

. It supplies an index

e

for which

f_{e, 1} ≃ f_{h (e), 1} .

Consequently

f_{e, 1} (y) ≃ g (e, y) for every y \in N .

 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