Activity
Dennis Hackethal revised criticism #5496.
Quote more context
Neil Hudson asks, “Why should HTV- or rationality generally - be required to supply” an algorithmic ranking?
Neil Hudson asks:
A fallible procedure can still be making the stronger claim that every admissible pair is algorithmically rankable. Why should HTV- or rationality generally - be required to supply that [such an algorithmic ranking]?