turing

Theoretically, if ethereum allows a turing-complete language to be executed, a code could be written to hack the system itself.

Ethereum instead took bitcoin and replaced that scripting language with a turing-complete language.

How many people who get Turing Awards in the next few decades will have learned their chops in a boot camp coding course?

It wouldn't take long for a Turing Farm to crack them all.

We need to characterize the canonical abstraction in the same way we characterize a turing machine.

Yes, it's all perfectly Turing compatible, of course we can also do that on Android.

It isn't turing complete, but it has basic input and output.

All turing machines can be encoded with finite bit arrays.

But then again, if they are copying and melding, but we can't tell, maybe it's good enough to pass a Turing test?

The busy-beaver number for a million-state Turing machine?

Just to chime in with the obligatory: sounds-interesting-but-for-the-love-of-turing-it's-infuriatingly-hard-to-find-a-basic-description-of-what-it-actually-is.

Based on intuitionistic logic, finite bit arrays, and the ability to interpret them as turing machines, we can follow the canonical construction of the reals.

Look up "turing complete" to get a sense for what the argument is about.

We transmit objects as a literal, or as an algorithm ("a turing machine") of how to recreate the object.

I am completely unfamiliar with Perl and its regular expressions, but from your article and this comment I get the impression that they are Turing-complete, which would mean they're capable of describing any formal language as well as doing any "doable" computation.

They had Turing's "bombe", multiple Enigma variants, many lesser-known crypto machines, historic correspondence, a Cray YMP, codetalkers exhibit, spy satellites, and tons of other good stuff.

D metaprogramming is Turing-complete, but yes, quite a bit behind, now even less powerful than the modern C++.

There is a binary test for a programmer: someone with basic proficiency in a Turing-complete language.

You don't even need a Turing-complete language to do it.