X hits on this document

105 views

0 shares

0 downloads

0 comments

10 / 40

Learnability Models

Basic concepts

Alphabet A is a non-empty finite set of symbols; A* is the (inifinite) set of all finite strings over A

Language is a subset of A*; a language class is the set of languages of the same underlying machine (some language is non-computable because 2A* is uncountable but the set of all possible TMs is countable)

Time t is discrete (t=1, 2, …)

Document info
Document views105
Page views105
Page last viewedSun Dec 11 06:38:47 UTC 2016
Pages40
Paragraphs326
Words1871

Comments