4 ms·
eBPF is not Turing-complete, I suppose.
by red_admiral 2y ago
eBPF is not Turing-complete, I suppose.
- lizxrice 2y agoIn this talk we demo Conway's Game of Life implemented in eBPF: https://www.youtube.com/watch?v=tClsqnZMN6I https://www.youtube.com/watch?v=tClsqnZMN6I
- lizxrice 2y agoI should clarify that individual eBPF programs have to terminate, but more complex problems can be solved with multiple eBPF programs, and can be "scheduled" indefinitely using BPF timers
- javierhonduco 2y agoIt is not, programs that are accepted are proved to terminate. Large and more complex programs are accepted by BPF as of now, which might give the impression that it's now Turing complete, when it is definitely not the case.