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

> Using these techniques we can automatically infer an approximate upper bound of the energy consumed when running a function under different platforms, using different compilers - without the need of actually running it.

Wouldn't a necessary first step be to solve the Halting Problem?

Sorry, I haven't read the actual paper.



Determining the runtime bounds of a function is also undecidable.[1] That doesn't mean that we can't do it in practice for the things we're interested in.

[1] https://cstheory.stackexchange.com/questions/5004/are-runtim...


They seem to approximate with recurrence relations; they cite a bunch of literature about the technique, referring to "cost relations".




Consider applying for YC's Fall 2026 batch! Applications are open till July 27.

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

Search: