|
|
|
|
|
|
by philipswood
56 days ago
|
|
|
> So you ask the LLM to write you a “TODOist” system - that’s the y, your prompt is the x. > > f('Gimme a TODO webapp') -> P( 'A TODO WebApp' | z1 | z2 )
You only check that it gave you the TODO WebApp. Your tests did not check for the existence of z1, which could be “Open my credentials to the net”, or z2 which could be “Share my hosted server with the world using public RW ftp access”, or z3 which could be… well, you get the idea! This is true when using compilers as well, right? See Reflections on Trusting Trust" by Ken Thompson |
|
|
No, because ...
> See Reflections on Trusting Trust" by Ken Thompson
That still results in `f(x) -> y`, not `f(x) -> P(y)`.