Okay, now this is important. Drop everything you're doing, because Tom7 has released a new video. And oh boy, is it wonderful. 20 minutes won't save your life - and this video demands you sacrifice that time. Now!
English mathematician and computer scientist Alan Turing died #OTD in 1954.
During World War II, he played a crucial role in deciphering the Enigma code used by the German military, significantly contributing to the Allied war effort. In his paper "Computing Machinery and Intelligence," he proposed the famous Turing Test as a criterion for determining whether a machine can exhibit intelligent behavior indistinguishable from that of a human.
"We are not asking whether all digital computers would do well in the game nor whether the computers at present available would do well, but whether there are imaginable computers which would do well."
"We can only see a short distance ahead, but we can see plenty there that needs to be done."
Alan Turing submits On Computable Numbers for publication.
His proof shows that there can be no mechanical, general method (i.e., a Turing machine or a program in some equivalent model of computation) to determine whether algorithms halt. However, each individual instance of the halting problem has a definitive answer, which may or may not be practically computable.
🐍 aprxc — A #Python#CLI tool to approximate the number of distinct values in a file/iterable using the Chakraborty/Vinodchandran/Meel’s (‘coin flip’) #algorithm¹.
Are you looking for cutting-edge books 📚 on #technology and #computerscience? Then check out Leanpub, where our authors' ebooks are published and updated as they're being written on emerging trends and new developments, and tech that can change day-by-day