Okay, here it is. This is the unofficial official timeline of #AI. I'm going to tell you what to expect, and it's definitely not: this all goes away and we return to before.
Are you ready for this? Are you sure? Well, read on.
Before I continue, I'm going to lay out some AI #benchmarks that we'll use to define "how good / scary is this AI?" This is in rough order of difficulty.
#Lovelace #Test for #Emergence: "Can a system produce surprising and useful outputes that weren't explicitely programmed via weak emergence?"
#Loebner Test: "Can a computer fool casual human judges in text conversations?" ( #Modern #LLM AIs are close to this )
#Turing Test (Original Imitation Game): "A man or a computer and a woman are both answering text interrogations trying to convince them that they are the woman. Can the computer perform as well as the man?" (This was the actual orginial #TuringTest.)
Strengthened #Imitation Game: "A man or a #computer and a woman are both answering text interrogations. Can the computer perform as well as the woman?"
#Coffee Test: "Can a #system enter a strangers house with no prior infor and using #perception, imitation, and #reasoning figure out how to make a cup of coffee?"
#College #Student Test: "Can a robot enroll in college, attend classes like an actual student, learn from the instructions things it didn't know before, and graduate?"
#VoightKampff Test: "Can a machine withstand adversarial exper interrogation and still pass as #human?"
#Harnad's Total Turing Test: "Is the system indistinguishible from humans in every aspect?" (This is a #DuckTest.)
Non #Duck Test: "Even with full access to internals, can experts find no evidence that it isn't a genuine human mind?"
**tur** — A language for defining/executing Turing machines
Supports parser, interpreter & visualization!
Try it out on web: 
Written in Rust & has a TUI w/ 
GitHub: 
Alan Turing showed that not everything logically definable is also computable.
Here’s the twist:
