Re:BPF: A New Type of Software
by ttctciyf on Tuesday December 03, 2019 @01:37PM
(#21695166)
From the accompanying video (17:11)[1] it's not Turing complete "because the verifier rejects unbounded loops and so there is some things that are not possible. We do have bounded loops in BPF now."
1: https://youtu.be/7pmXdG8-7WU?t=1031