Not quite - in complexity theory you say problem A reduces to problem B if an or... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		bubblyworld 6 months ago \| parent \| context \| favorite \| on: Hard problems that reduce to document ranking Not quite - in complexity theory you say problem A reduces to problem B if an oracle for problem B can be used to solve problem A. So the title of the article is correct, as an oracle for document ranking (LLMs in this case) can be used to solve a list of hard problems (given in the article).

moralestapia 6 months ago [–]

Wrong.

At least bother to read the discussion in the sibling comments.

bubblyworld 6 months ago | [–]

It's standard terminology. I'm not going to waste time arguing about it.

moralestapia 6 months ago | | [–]

Define what's an oracle for you, that's a concept that's not even needed for this discussion.

I don't think you understand what is being talked about here.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact