X hits on this document

85 views

0 shares

0 downloads

0 comments

11 / 40

Learnability Models

Basic concepts

A primitive recursive function is

a recursive function (but not vice versa, e.g., Ackermann’s function)

composed by a finite number of applications of composition and primitive recursion over null(0), successor and projection functions.

a total function, i.e., defined on all natural numbers

A string can be encoded into a single integer i.e., we can always have a A* function

Document info
Document views85
Page views85
Page last viewedMon Dec 05 10:59:03 UTC 2016
Pages40
Paragraphs326
Words1871

Comments