Archived tweet #9841 from the @leastfixedpoint Twitter Archive

@DRMacIver This sounds... hard. I think (?) it's computable, though? Because there are only finitely many candidate Cs smaller than or equal to the size of B, which is a reasonable upper bound? #hlepful