Inductive Inference and Computable One‐One Numberings

Authors

Rūsiņš Freivalds, University of Latvia
Efim Kinber, Sacred Heart UniversityFollow
Rolf Wiehagen, University of Kaiserslautern

Document Type

Peer-Reviewed Article

Publication Date

1982

Abstract

The authors investigate the difficulty and the power of inductive inference in one-one numberings which are minimal/maximal with respect to some uniform reducibility notions.

Comments

.

DOI

10.1002/malq.19820282708

Recommended Citation

Freivalds, R., Kinber, E., & Wiehagen, R. 1982). Inductive inference and computable one‐one numberings. Mathematical Logic Quarterly, 28, 463-479. Doi: 10.1002/malq.19820282708