petercerno

Hi, I would like to share with you my own C++ backtesting engine that I have been using for a while for analysing all sorts of cryptocurrency trading ideas and strategies. I think that many people could potentially benefit from a tool like this. Although I have spent a lot of time testing and unit-testing this tool, there still might exist some uncovered bugs. So please use at your own risk. If there is one learning that I would like you to take away from this is that trading is a hard game to master. :) Anyway, I would appreciate your opinions and suggestions for improvement. The tool is definitely far from perfect. Thx!

> Plus, you can actually empirically compute a finite set of initial digits (a specific Turing machine can be analyzed to see if it terminates or not).

Well, the fact that the number is not computable means that there will exist an index i, for which you will not be able to compute a_i (no matter how hard you try). In other words, you will not be able to analyze the Turing Machine i, i.e. it will not be possible to prove the termination or non-termination of the Turing Machine i.

So this specific digit will be a mystery forever, and you would not be able to compare it to anything.

Think about a real number with digits: 0.a_1 a_2 a_3 ... in which a_i encodes whether Turing Machine with index i (or program i) halts or not. Since Halting problem is not computable, we will never be able to compute the digits of this real number. Never in our universe.