Hah. I'm sure that's the first thing we'll all use quantum computers for.
On Fri, Aug 1, 2014 at 3:02 PM, Jutho <[email protected]> wrote: > +1 for this quote of yours: > "The algorithm Julia uses for type inference works by walking through a > program, starting with the types of its input values, and abstractly > interpreting the code. Instead of applying the code to values, it applies > the code to types, following all branches concurrently and tracking a > superposition of all the possible states the program could be in, including > all the types each expression could assume. (There's a certain similarity > to the execution of a non-deterministic finite automaton or the process of > quantum computation.)". > > Maybe time to start thinking of how Julia could benefit from quantum > computers. > > Op vrijdag 1 augustus 2014 19:36:00 UTC+2 schreef Stefan Karpinski: >> >> Cool. There was an interesting discussion >> <https://groups.google.com/forum/#!topic/sage-devel/1gPkeL_X5dw/discussion> >> of using multiple dispatch for type promotion on the Sage mailing list >> recently, which started out with links to Graydon Hoare's lovely blog post >> about the history of scientific computing. >> >> >> On Fri, Aug 1, 2014 at 2:41 AM, cdm <[email protected]> wrote: >> >>> >>> if it might interest you, have a look at: >>> >>> http://sagemath.blogspot.com/2014/07/sagemathcloud-history- >>> and-status.html >>> >>> >>> best, >>> >>> cdm >>> >> >>
