<d_bot>
<octachron> @qubit1 : 24 February + 6 month = 24 August, 24 August + summer holidays ≃ Late September
motherfsck has quit [Ping timeout: 240 seconds]
<d_bot>
<qubit1> Ok, thanks!
mxns has joined #ocaml
mxns has quit [Ping timeout: 260 seconds]
zebrag has joined #ocaml
mxns has joined #ocaml
mxns has quit [Ping timeout: 246 seconds]
mxns has joined #ocaml
mxns has quit [Ping timeout: 250 seconds]
jackt85 has joined #ocaml
bjorkintosh has quit [Quit: Leaving]
tane has quit [Quit: Leaving]
waleee-cl has joined #ocaml
<d_bot>
<stab> Using arbitrary length integers will be a big performance hit compared to say a bitvector right? Trying to implement this paper http://www.es.mdh.se/pdf_publications/3813.pdf and it handles bit widths by using arbitrary length integers then bringing stuff back into the bitwidth domain with mod 2w. The one implementation ive seen for this is using bitvectors which just seems off to me tbh
zebrag has quit [Quit: Konversation terminated!]
<d_bot>
<stab> infact their docs pretty much say they arent doing canonization correctly since they state "Its actual cardinality could be less since the CLP may overlap itself" which is specifically what canonization is built to avoid. The simplest solution here would just be to use big int, just wondering how bad that is gonna be on performance
mxns has joined #ocaml
mxns has quit [Ping timeout: 252 seconds]
ghosthell has joined #ocaml
<ghosthell>
Non-Terrestrial or Terrestrial beings Which have Access to Trans-Un1versal Transp0rtation Please PM me*%