FT App on Android & iOS
Notice how the highlighted region shrinks at each step. The algorithm never examines points outside the narrowing window. In a balanced tree with nnn points, this takes about log4(n)\log_4(n)log4(n) steps. For a million points, that's roughly 10 steps instead of a million comparisons.
，推荐阅读91视频获取更多信息
对于此事件，RLHF （基于人类反馈的强化学习）领域最知名的研究者之一，《RLHF》一书的作者 Nathan Lambert 指出，这件事没有人们想象的那么严重，但也没有那么简单。
[단독]폴란드, 韓 해군 최초 잠수함 ‘장보고함’ 무상 양도 안받기로
However, Tolley points out that humans don't move the way fans spin, at all. "We want to be able to lift things, and push things, and do things that require a lot of force and torque."