Are fixed-point combinators general recursive?

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

質問

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?

正しい解決策はありません

ライセンス： CC-BY-SA と 帰属
所属していません cs.stackexchange
scroll top