undefined | Better HN

0 pointsllm_trw1y ago0 comments

Finding a path between two vertices when given an itinerary of all the edges in a general graph, exactly what I said in the OP.

0 comments

mkl1y ago

Did you try asking them to write a program to do it?

andrepd1y ago

GP is trying to test the ability of LLMs to perform mathematical tasks, not their ability to store geeks4geeks pages.

llm_trwOP1y ago

Not sure why you're being downvoted that is exactly why I'm using that simple problem to benchmark LLMs. If an LLM can't figure out how to traverse a graph in its working memory then it has no hope of figuring out how to structure a proof.

Under natural deduction all proofs are sub trees of the graph which is induced by the inference rules from the premise. Right now LLMs can't even do a linear proof if it gets too long when given all the induced vertices.

j / k navigate · click thread line to collapse