4 ms·
Noob here woth a doubt: “Incredible! We are exhaustively searching an uncountably infinite space in finite time” Isn’t this like a long stretch? Once lazy eva
by xondono 8y ago
Noob here woth a doubt:
“Incredible! We are exhaustively searching an uncountably infinite space in finite time”
Isn’t this like a long stretch? Once lazy evaluation is introduced he is pretty much checking until a first hit happens, isn’t he?
What would happen if I call the function with predicate
‘x == one AND x == zero’?
- blattimwind 8y ago> What would happen if I call the function with predicate ‘x == one AND x == zero’? Then the algorithm never halts.
- jozefg 8y agoThis algorithm is only total if the predicates supplied are total. Since `x == one AND x == zero` is not total the algorithm will diverge. It will not return the incorrect answer though.