So...
Password is 9 characters
Letter and numbers
Darkened letters ;
Image 100 = CA
Image 001 = TA
Image 000 = BC
Charles Babbage, Image 000, made the difference engine and the analytical engine, that was considered as a computer.
Alonzo Church, Image 100, inventor of the Lambda Calculus, which is in a way the first programming language ever
So far we have, the first computer, the first programming language.
As for Alan Turing, Image 001, he was also a mathematician, cryptalanist. He has created the cryptography and calculability. Turing is widely considered to be the father of theoretical computer science and artificial intelligence.[He made the turing test and ;
In computability theory, the Church–Turing thesis (also known as the Turing–Church thesis,[1] the Church–Turing conjecture, Church's thesis, Church's conjecture, and Turing's thesis) is a hypothesis ("thesis") about the nature of computable functions. In simple terms, the Church–Turing thesis states that a function on the natural numbers is computable in an informal sense (i.e., computable by a human being using a pencil-and-paper method, ignoring resource limitations) if and only if it is computable by a Turing machine. The thesis is named after American mathematician Alonzo Church and his Ph.D. student, the British mathematician Alan Turing.
Church [2] and Turing [3] proved that these three formally defined classes of computable functions coincide: a function is λ-computable if and only if it is Turing computable if and only if it is general recursive. This has led mathematicians and computer scientists to believe that the concept of computability is accurately characterized by these three equivalent processes.
Turing adds another definition, Rosser equates all three: Within just a short time, Turing's 1936–37 paper "On Computable Numbers, with an Application to the Entscheidungsproblem"[18] appeared. In it he stated another notion of "effective computability" with the introduction of his a-machines (now known as the Turing machine abstract computational model). And in a proof-sketch added as an "Appendix" to his 1936–37 paper, Turing showed that the classes of functions defined by λ-calculus and Turing machines coincided.[23] Church was quick to recognise how compelling Turing's analysis was. In his review of Turing's paper[24] he made clear that Turing's notion made "the identification with effectiveness in the ordinary (not explicitly defined) sense evident immediately".
In a few years (1939) Turing would propose, like Church and Kleene before him, that his formal definition of mechanical computing agent was the correct one.[25] Thus, by 1939, both Church (1934) and Turing (1939) had individually proposed that their "formal systems" should be definitions of "effective calculability";[26] neither framed their statements as theses.
Rosser (1939) formally identified the three notions-as-definitions:
"All three definitions are equivalent, so it does not matter which one is used."[27]
-------------
So they have a link...All mathematicians, thats why the op want us to calculate the answer. Seem that when we have the calculated answer, we would have to throw it in the bin. I would expect Binary in that situation.
OP said that if they work together, they would have found the solution.
soooo....
A computer, A cryptography and programming...
We have to Program a Cryptography on the computer ?
I think OP want us to resolve a block by adding each letter and numbers that are hint on the picture using a program that resolve a crypto equation then put it in the bin to get the 9 letters code.
He also said the calculation could be made by a 5 year old. So i doubt it has to do with an equation or anything similar