Category: Kent Crispin

Posted on

This may lead to a practical, feasible solution, to factor the product of two very large prime numbers (with…

Originally shared by Vincent Granville

This may lead to a practical, feasible solution, to factor the product of two very large prime numbers (with thousands of digits), making many security systems vulnerable to new types of attacks: factoring encryption keys, en masse. Let’s start with the pictures. The patterns (as well as how to leverage them) are explained below.

http://www.datasciencecentral.com/profiles/blogs/spectacular-patterns-found-in-rare-almost-random-numbers?xg_source=activity
Posted on

Complex “finite state machines” – easily implemented:

Originally shared by Guido Stepken

Complex “finite state machines” – easily implemented:

A short tutorial: http://www.gedan.net/2008/09/08/finite-state-machine-matrix-style-c-implementation/

And one with function pointers: http://stackoverflow.com/questions/1371460/state-machines-tutorials

Both are working with decision tables, which are very easy to verify. You can even print them out, edit them in EXCEL, … No longer “if then else if if …” – orgies, no complex parsers, … just plain “C”.

And i can tell you – blindingly faaaaaaast!!!

Very well suited for implementing “Business Administration Rules” ( Business Process Management, , ) or for defining “behaviour” of RPi GPIO, traffic lights, robots, ….

Have fun!