Algorithmic representation of wermus' constructions of ordinal numbers

In his paper [3] Wermus defines ordinal numbers as "Z - symbols" of the form [a_1n ..., a_k   κ, ≥ 1 and [a₁] , where the a_j, 1≤ j, ≤ κ, are natural numbers or  Z -symbols. It wi II be demonstrated that Wermus' constructions can be described by means of a special Neumer algorithm, the constructive algorithm of [1], part I and V resp. a descriptive algorithm of  [2], part III ; more precisely:  that there can be established a 1-1 correspondence between Z- symbolsi [a_1n ..., a_k ] and algorithmic symbols T[a_1n ..., a_k ] such that [a_1n ..., a_k ] and T[a_1n ..., a_k ] represent  the same ordinal number. This comparision of the two systems further allows the determination of the least ordinal number which is inaccesible by Wermus' constructions in [3].