Classifying the Arithmetical Complexity of Teaching Models

摘要

This paper classifies the complexity of various teaching models by their position in the arithmetical hierarchy. In particular, we determine the arithmetical complexity of the index sets of the following classes: (1) the class of uniformly r.e. families with finite teaching dimension, and (2) the class of uniformly r.e. families with finite positive recursive teaching dimension witnessed by a uniformly r.e. teaching sequence. We also derive the arithmetical complexity of several other decision problems in teaching, such as the problem of deciding, given an effective coding {£_o, £_1, £_2,…} of all uniformly r.e. families, any e such that £_e = {L_0~e, L_1~e,...,}, any i and d, whether or not the teaching dimension of L_i~e with respect to £_e is upper bounded by d.