41–46 of 46 posts
> The Maybe type constructor is predefined by Haskell as [...] It's hard for me to imagine a reader that understands the rest of this jargon, presented without explanation, who does not know what `Maybe` is.
Can someone explain how find works if the predicate is something like: return true if and only if every other bit is 1
I find this very interesting, but I'm unable to understand it, so the result still seems impossible to me. Can someone explain how find works if the predicate is something like: return true if and only if every other bit is 1
I find this very interesting, but I'm unable to understand it, so the result still seems impossible to me. Can someone explain how find works if the predicate is something like: return true if and only if every other bit is 1
Can someone explain to me in plain English what this is? I looked up Cantor Sets so I have a vague understanding... but there are many things I don't understand. Like what does it mean to have a sequence with a bit appended to a Cantor Set? Why is that a Cantor Set? What the heck is a total p - is it a function?
p is a predicate, which is a function mapping elements of some type to true/false (booleans). A total function is a function which is defined for all possible inputs. So a total predicate is a function that maps all possible inputs to either true or false.
Can someone explain to me in plain English what this is? I looked up Cantor Sets so I have a vague understanding... but there are many things I don't understand. Like what does it mean to have a sequence with a bit appended to a Cantor Set? Why is that a Cantor Set? What the heck is a total p - is it a function?
Thank you for asking this, I was having a devil of a time googling what "total" meant in this context.