Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
CuriouslyC
3 days ago
|
parent
|
context
|
favorite
| on:
Towards a science of scaling agent systems: When a...
I only agree with that statement if you're drawing from the set of all possible problems a priori. For any individual domain I think it's likely you can bound your analytic. This ties into the no free lunch theorem.
zby
2 days ago
[–]
Computers are finite - but we use an unbounded model for thinking about them - because it simplifies many things.
reply
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: