Online and feasible presentability: from trees to modal algebras

Nikolay Bazhenov, Dariusz Kalociński, Michał Wrocławski

We investigate whether every computable member of a given class of structures admits a fully primitive recursive (also known as punctual) or fully P-TIME copy. A class with this pr…