| http://www.w3.org/ns/prov#value | - How large a number could be uniquely specified (without recourse to tactics intefered with by computing whether something will halt or not, which is a problem suffered by the more loosely specified [http://en.wikipedia.org/wiki/Busy_Beaver Busy Beaver] [*2]) in that many characters?
|