eBPF isn’t Turing complete because it has to be able to prove that loops are bou... | Hacker News

Hacker News new | past | comments | ask | show | jobs | submit

login

umanwizard 6 months ago | parent | context | favorite | on: How we found and fixed an eBPF Linux kernel vulner...

eBPF isn’t Turing complete because it has to be able to prove that loops are bounded.

Join us for AI Startup School this June 16-17 in San Francisco!
Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact