sentence1: it is well-known that on turing machines , for self-reducible problems the accuracy of approximate counting can be boosted and approximate counting implies exact sampling .
sentence2: it is well known that for self-reducible problems , approximate counting and approximate sampling are inter-reducible on polynomial-time turing machines .