Are fixed-point combinators general recursive?
-
01-11-2019 - |
题
I don't know if I'm using the vocabulary correctly, but what I'm interested in is this: If your language has fixed-point combinators, is it Turing-complete?
没有正确的解决方案
不隶属于 cs.stackexchange