# Are fixed-point combinators general recursive?

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?

• Nice question. Can you do anything interesting if all you have is fixed-point combinators? – David Richerby Nov 14 '14 at 9:28