Open question

Filed under: Scrapbook | Tags: | junio 3rd, 2013
Post

If a countable class of recursive languages has a mind change bound for noncomputable learners, does the class also have a mind change bound for computable learners, or is the class unlearnable by a computable learner?


Deja un comentario

Tu dirección de correo electrónico no será publicada. Los campos obligatorios están marcados con *