🚀 go-pugleaf

I read a paper about 2-3 years ago in which 
the author gave some examples of programs for which
the existing functional solutions were of a 
worse order than their imperative counterparts.

There were two things of interest:

   Some examples of "open" problems, i.e. problems
   for which there was an algorithmic gap in the  
   best-known functional and imperative solutions,

   A statement that no problems had yet been found
   that had provably worse lower functional bounds.

Does anyone know where I can find this?

Do we currently know whether the complexity
classes are equal for both paradigms?

Thanks
Peter
--
EP Wentworth - Dept. of Comp. Sci. - Rhodes University - Grahamstown - RSA.
cspw@alpha.ru.ac.za  		       Any views expressed here are my own.