They are both Turing complete, they can implement each other. But, the effort to implement call-by-need evaluation (graph rewriting or remembrance of computed

They are both Turing complete, they can implement each other. But, the effort to implement call-by-need evaluation (graph rewriting or remembrance of computed value) is higher in strict languages than (sparse) addition of annotations in lazy ones.