Are fixed-point combinators general recursive?

cs.stackexchange https://cs.stackexchange.com/questions/33100

Question

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?

No correct solution

Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange
scroll top