Let k ě 3. Given a k-uniform hypergraph H, the minimum codegree δpHq is the largest d P N such that every pk´1q-set of V pHq is contained in at least d edges. Given a k-uniform hypergraph F , the codegree Turán density γpF q of F is the smallest γ P r0, 1s such that every k-uniform hypergraph on n vertices with δpHq ě pγ `op1qqn contains a copy of F . Similarly as other variants of the hypergraph Turán problem, determining the codegree Turán density of a hypergraph is in general notoriously difficult and only few results are known.In this work, we show that for every ε ą 0, there is a k-uniform hypergraph F with 0 ă γpF q ă ε. This is in contrast to the classical Turán density, which cannot take any value in the interval p0, k!{k k q due to a fundamental result by Erdős.