✦ LIBER ✦

A learning-theoretic characterization of classes of recursive functions

✍ Scribed by Martin Kummer

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 673 KB
Volume: 54
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(95)00036-c

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Classes of One-Argument Recursive Functi

Classes of One-Argument Recursive Functions

✍ Nadejda V. Georgieva 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 252 KB 👁 1 views

Complexity classes of provable recursive

Complexity classes of provable recursive functions

✍ Dan Gordon 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 582 KB

Plain Bases for Classes of Primitive Rec

Plain Bases for Classes of Primitive Recursive Functions

✍ Stefano Mazzanti 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB 👁 1 views

Classes of Recursive Functions and Their

Classes of Recursive Functions and Their Index Sets

✍ F. D. Lewis 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 237 KB 👁 1 views

A combinatorial characterization of cert

A combinatorial characterization of certain universal classes of hash functions

✍ Tran van Trung 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 303 KB

## Abstract A new lower bound on the size of ϵ‐almost strongly universal~2~ classes of hash functions has recently been obtained by Stinson [8]. In this article we present a characterization of ϵ − ASU~2~ classes of hash functions meeting the Stinson bound in terms of combinatorial designs. © 1994

A Hierarchy of Primitive Recursive Funct

A Hierarchy of Primitive Recursive Functions

✍ J. P. Cleave 📂 Article 📅 1963 🏛 John Wiley and Sons 🌐 English ⚖ 758 KB