tag:blogger.com,1999:blog-8288194986820249216.post7914510233264581774..comments2024-03-22T05:09:17.789-07:00Comments on Abstract Heresies: Joe Marshallhttp://www.blogger.com/profile/03233353484280456977noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-8288194986820249216.post-36120344708576076242008-08-04T12:46:00.000-07:002008-08-04T12:46:00.000-07:00I disagree just a bit. We're using IF to paste to...I disagree just a bit. We're using IF to paste together two partial functions: the one for the case that X is true, the other for the case X is false. We'd like to be sure our resulting function is well-defined over the domain of interest, and because our predicate is binary we're ok.<BR><BR>But what if we had a language with `fuzzy' predicates that indicate a blend between truth and falsehood. We'd need to figure out how that blend would map into the log space. In other words, we do need to consider the log-space version of if, but because it is simply a discontinuity at a single point, the equivalent version is trivially the same.Joe Marshallhttps://www.blogger.com/profile/03233353484280456977noreply@blogger.comtag:blogger.com,1999:blog-8288194986820249216.post-15636289105783831862008-08-04T11:54:00.000-07:002008-08-04T11:54:00.000-07:00No need to consider log equivalency for IF.(FUN (I...No need to consider log equivalency for IF.<BR/><BR/>(FUN (IF X Y Z)) == (IF X (FUN Y) (FUN Z))<BR/><BR/>Always. Since IF is not a function, you need to consider evaluation order, nothing else.Anonymousnoreply@blogger.com