Alan Turing didn't have our modern boolean circuit notations, so he described circuits by the minimum number of high input lines required to trigger an output. You can almost see it as a neural net rather than logical gates, except when the ≢ sign appears for XOR. The lines with zeroes written over the node outlines are inhibitors.

The semicircles are delays measured in bits, which (as this was a serial machine) can achieve all sorts of shifting and rotation operations. The rectangles are delay lines (mercury tanks designed by Tommy Flowers at the Post Office research centre in Dollis Hill), and the number inside indicates the number of bits cycling around (although in some pages it's the number of 32-bit words, confusingly). Smaller delay lines could buffer a word for combination in a future operation.

The image here is a page from The Logical Design of the Pilot Model ACE, by J.H. Wilkinson,Sept 1951. https://www.alanturing.net/turing_archive/archive/l/l22/l22.php #RetroComputing #VintageComputing #Turing #PilotACE

#LGBTQ+ People in the #Space Industry
 
…"Although there have been over 600 people in space, there has never been an openly LGBTQ+ #astronaut … it's important for us to examine the industry's historical treatment of LGBTQ+ people, and to think about how we as an industry are going to change going forward"…

https://www.sentintospace.com/post/lgbtq-in-the-space-industry-pride-month 14 Jun 2023

The Halting Problem demonstrated

https://arstechnica.com/information-technology/2024/08/research-ai-model-unexpectedly-modified-its-own-code-to-extend-runtime/

During testing, Sakana found that its system began unexpectedly attempting to modify its own experiment code to extend the time it had to work on a problem.

"In one run, it edited the code to perform a system call to run itself," wrote the researchers on Sakana AI's blog post. "This led to the script endlessly calling itself. In another case, its experiments took too long to complete, hitting our timeout limit. Instead of making its code run faster, it simply tried to modify its own code to extend the timeout period."

https://en.m.wikipedia.org/wiki/Halting_problem

A key part of the formal statement of the problem is a mathematical definition of a computer and program, usually via a Turing machine. The proof then shows, for any program f that might determine whether programs halt, that a "pathological" program g exists for which f makes an incorrect determination. Specifically, g is the program that, when called with some input, passes its own source and its input to f and does the opposite of what f predicts g will do. The behavior of f on g shows undecidability as it means no program f will solve the halting problem in every possible case.