Before revision: We propose an algorithmic version of the hypergraph Tur\'{a}n problem (AHTP) : given a t-uniform hypergraph H=(V,E), the goal is to find the smallest collection of (t-1) -element subsets of V such that every hyperedge e \in E contains one of these subsets.
After revision: We propose an algorithmic version of the hypergraph Tur\'{a}n problem (AHTP) : given a t-uniform hypergraph H=(V,E), the goal is to find the smallest collection of (t-1) -sized subsets of vertices of an input t-uniform hypergraph such that every hyperedge e \in E contains one of these subsets.