On a question of Frank Stephan

Authors:
Klaus Ambos-Spies;Serikzhan Badaev;Sergey Goncharov
Affiliations:
University of Heidelberg, Heidelberg, Germany;Kazakh National University, Almaty, Kazakhstan;Sobolev's Math. Institute, Novosibirsk, Russia
Venue:
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Year:
2008

Citing 1
Cited 1

Systems that learn: an introduction to learning theory for cognitive and computer scientists

Systems that learn: an introduction to learning theory for cognitive and computer scientists

Inductive inference and computable numberings

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

For many TxtEX-learnable computable families of recursively enumerable sets, all their computable numberings are equivalent with respect to the reduction via the functions recursive in the halting problem. We show that this holds for every TxtEX-learnable computable family of recursively enumerable sets, but, in general, the converse is not true.