If anyone has access to time and computers, and wants to collaborate on finding the *definitely* minimal superpermutation on 6 symbols (or other such things), please get in touch!
-
-
-
-
-
Replying to @westendwookie
The first thing we need to do is figure out the best way to do it, so I’m not even sure yet. I would guess it’s going to be pretty parallelisable, though.
1 reply 0 retweets 0 likes -
Replying to @robinhouston @westendwookie
parallelism sounds like
@rustlang1 reply 0 retweets 0 likes -
Could be, though we don’t want to have to reinvent all the code that has already been written in C and C++, e.g. http://www.math.uwaterloo.ca/tsp/concorde/
2 replies 0 retweets 1 like -
Replying to @robinhouston @westendwookie
We work well with C and C++, in both directions. For example, Firefox is a huge C++ codebase with some Rust inside
2 replies 0 retweets 3 likes
That said, adding a new technology is a big decision and you should do what’s right for your situation 
9:47 AM - 30 Jan 2018
0 replies
0 retweets
0 likes
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.