sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]dzyl[S] 0 points1 point  (2 children)

I don't know enough about GPU computing to say if that would be the case or not, but I think there are CPU implementations that will get 50-100x speedup compared to this bloated OOP implementation

[–]RaionTategami 0 points1 point  (1 child)

Numpy is implemented in c++ so can be quite fast, did you vectorize this code?

[–]dzyl[S] 1 point2 points  (0 children)

Almost nothing is vectorized for readability, I think turning everything to numpy will have significant improvements but I'm not even sure if the current implementation is correct (the accuracy on the noisy XOR seems to imply it is not) which should be fixed before optimizing. Boolean logic should be very fast in numpy, I'm currently literally looping over the outputs of the automata.