High Quality Content by WIKIPEDIA articles! In computability theory, computational complexity theory and proof theory, a fast-growing hierarchy (also called an extended Grzegorczyk hierarchy) is an ordinal-indexed family of rapidly increasing functions f?: N > N (where N is the set of natural numbers {0, 1, ...}, and ? ranges up to some large countable ordinal). A primary example is the Wainer hierarchy, or Lob–Wainer hierarchy, which is an extension to all ? ...

В наличии:
	Books.Ru - 1128 руб.	Перейти
Под заказ:
	OZON.ru - 1125 руб.	Перейти

Рейтинг книги: 4 из 5, 7 голос(-ов).