Skip to content

14. Corollary of Reversing

Jump to bottom
Eric Ung edited this page Nov 13, 2023 · 2 revisions

Corollary of Reversing

This corollary is supposed to show the reader that this language is based off of Turing's computational complexity theory by showing us that there is a string consisting of the integers 0 and 1.

Exercises

  1. Can you figure out how to determine if a string of 0's and 1's forms a cyclical pattern in general?

  2. If you have two rules such that 0 becomes 01 and 1 becomes 0 and you start with 0, how would you process the steps to get to the some nth generation?

Clone this wiki locally