Comparing #5496 (Version 1) and #5500 (Version 2)

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]?

#5500​·​Dennis Hackethal​·​about 22 hours ago​·​Criticism
3 comments: #5497, #5498, and #5499