Ciro Santilli @cirosantilli 37

Users:

XML predecessor.

Once you hear about the uncomputability of such problems, it makes you see that all Diophantine equation questions risk being undecidable, though in some simpler cases we manage to come up with answers. The feeling is similar to watching people trying to solve the Halting problem, e.g. in the effort to determine BB(5).

To remove and install Shimano and ISIS Drive splined 20-tooth bottom bracket cups.

Bought: 2020-11-07. Also getting a park Tool PAW-12 adjustable wrench to use with it.

They seem to do some cool stuff.

They have also declined every one of Ciro Santilli's applications for software engineer jobs before any interview. Ciro always wondered what does it take to get an interview with them. Lilely a PhD? Oh well.

In the early days at least lots of gamedev experience was enough though: www.linkedin.com/in/charles-beattie-0695373/.

This is the discrete logarithm problem where the group is a cyclic group.

In this case, the problem becomes equivalent to reversing modular exponentiation.

This computational problem forms the basis for Diffie-Hellman key exchange, because modular exponentiation can be efficiently computed, but no known way exists to efficiently compute the reverse function.