Finally unsilenced!
“It’s not impossible” by BH927… Proven? (Turing Machine Simulation in GKC)
Most Gimkitters (and if you plan to work in a technical GImkit field I recommend you read the short guide) are familiar with the infamous topic by former moderator Blackhole927 claiming “It’s not impossible” (It's not impossible). What BH927 is saying in this topic is that anything can be made in GKC. Most of us took that info for granted, but the “It’s not impossible” has not been formally proven. That is what I am trying to accomplish.
How?
To prove that anything can be made in GKC, we need to simulate a Turing Machine, or atleast a minimalist Turing Complete language (like Rule 110).
What are Turing Machines?
Turing Machines were theorized by computer scientist Alan Turing in 1936. At the time, a Turing Machine was simply an abstract, hypothetical idea. It was only until decades later did we build physical versions. Turing Machines are simple to understand without much prior knowledge to computer science. It has 3 main components:
- A long string (in a theoretical version, it’s supposed to have infinite length, but was changed to finite to bring to the physical world) of either 1, 0 or blank (□). (ex. □□□1010111001□□□)
- A head that will read each digit in the string, and will change each digit depending on a rule it follows (a statement).
- Finite number of statements, which are like rule cards. The head follows these rules.
If you would like a clearer and better visual of a Turing Machine, I highly recommending the following Wikipedia page and ComputerPhile video below:
The goal of this topic is to simulate a Turing Machine in GKC, and subsequently formally prove that GKC is Turing complete, meaning it can simulate any computation given enough time and memory.
I invite anyone of any Gimkit skill level and of any computer science knowledge to help me in simulating a Turing Machine in GKC!
Quick question:
Does this topic fit under clay-institute?
Sadly computer in GKC will be on hold until we can do this