Telecharger Cours

Computability Theory (hybrid meeting)

? CBTr : Tr ? Tr×NN×N: given a tree T find wCBTr(T) plus the cardinality of the scattered part of [T]. Jeff Hirst in [2] proved that PKTr ?W ?1. 1-CA ...



Download