Are makefiles Turing complete?
Yes, see this. Once you have lambda, it’s all downhill from there. Here is a plagiarized Fibonacci example This should be enough to build a foundation for more generality (I’ve got to get back to work, or I’d play more.) dec = $(patsubst .%,%,$1) not = $(if $1,,.) lteq = $(if $1,$(if $(findstring $1,$2),.,),.) gteq … Read more