'Primitive recursion' presentation slideshows

::ICS 804:: Theory of Computation - Ibrahim Otieno - iotieno@uonbi.ac.ke +254-0722-429297

::ICS 804:: Theory of Computation - Ibrahim Otieno - iotieno@uonbi.ac.ke +254-0722-429297 SCI/ICT Building Rm. G15. Course Outline. Mathematical Preliminaries Turing Machines Recursion Theory Markov Algorithms Register Machines Regular Languages and finite-state automata

883 views • 80 slides

Some Primitive Recursive Functions

Some Primitive Recursive Functions. Example 3: h(x) = x! Here are the recursion equations: h(0) = 1 h(t + 1) = h(t) ? s(t) This can be rewritten as: h(0) = s(n(t)) h(t + 1) = g(t, h(t)) where g(x 1 , x 2 ) = s(x 1 ) ? x 2 , which can be written as:

335 views • 16 slides

Homework Questions

280 views • 15 slides