[Haskell-cafe] Signature for non-empty filter

[Bulat Ziganshin]

Hello Dan,

Thursday, February 7, 2008, 4:04:03 AM, you wrote:

> I.e., it's not necessary to restrict the class of functions you consider
> if you're willing to give up on full automation.  So I disagree with the
> "only if" below.

ok, read this as "computer can ensure...", because it was exactly the
original question - "can computer check that any given function in
turing-complete language is non-trivial?"

>> this means that answer to original question - one can ensure that
>> argument for filter is non-terminating function only if these
>> functions are written using some special notation which doesn't allow
>> to write arbitrary turing-complete algorithms
>> 


-- 
Best regards,
 Bulat                            mailto:Bulat.Ziganshin at gmail.com