Re:The two types of C programmers (a provocative thesis)
by gavinhoward on Wednesday April 26, 2023 @09:28AM
(#35713333)
You don't need an infinite list of functions to run into the problems with Turing-completeness. You only need effectively infinite behavior, which means all you need is effectively infinite possible inputs.
Re:The two types of C programmers (a provocative thesis)
by throwawaymaths on Wednesday April 26, 2023 @08:15PM
(#35721656)
this is simply untrue. I'm sorry. I recommend studying math a bit more rigorously before making claims in the future.
This is only a turing completeness issue if the list of functions is infinite. It is not, in zig.