AndrewAvenue
"awesomeness"
he/him 15
Last active:
Mood:
View my: Blog | Forum Topics
Contacting AndrewAvenue
Add to Friends
Add to Favorites
Send Message
Forward to Friend
Instant Message
Block User
Add to Group
Report User
SpaceHey URL:
https://spacehey.com/andrewavenue
AndrewAvenue's Interests
|
General |
3D modeling |
|
Music |
folk punk |
|
Movies |
Moonfall Don't look up Missing Unfriended |
|
Television |
My Little Pony |
|
Books |
Probably like, idk how to teach your dog physics or whatever that book is called. I do not really read books. |
|
Heroes |
shrug |
AndrewAvenue's Latest Blog Entries [View Blog]
There are no Blog Entries yet.
AndrewAvenue's Blurbs
About me:
Hey everyone, Andrew here.
I love computer science, and the theory of computer science. Here are some topics, with my knowledge on them.
Cellular automata:
Cellular automata, automata meaning "machine", so a machine based off of cells.
What are cells? Cells are mostly depicted as a single square of a grid. a cell can either store a value of 0 or 1 : Black or white. If you have enough cells, you can assign rules to these cells. For example Conway's game of life, the most popular cellular automata.
(Copied from wikipedia)
1. Any live cell with fewer than two live neighbors dies, as if by underpopulation.
2. Any live cell with two or three live neighbors lives on to the next generation.
3. Any live cell with more than three live neighbors dies, as if by overpopulation.
4. Any dead cell with exactly three live neighbors becomes a live cell, as if by reproduction.
Based off these simple rules, a complex system is born. A system that can perform any calculation that any other digital computer can, it can even run a simulation of itself. This is what we call Turing completeness.
Turing completeness:
Alan Turing is a computer scientist born on June 23, 1912. He is credited as being the founder of modern computer science. One such theory Alan had was a "Turing machine". A Turing machine consists of:
1.A tape constructed out of cells that infinitely go on infinitely in a 1 dimensional manner.
2.The Read/Write head
The Read/Write head or for short RWH, as you might of excepted can read/write onto the cells. Based on what number the RWH reads, it can swap to a different set of rules. The rules are stored in a table, and they can be something like a cellular automata ruleset, or just moving the RWH left or right.
Using the RWH we can change the cells in the tape. with this we are able to preform any calculation that any other digital computer can, Thus we have Turing completeness.
If you notice any mistakes I made in this information, please feel free to leave a comment about it!
Who I'd like to meet:
People interested in any fields of computer science.
AndrewAvenue's Friend Space
[view all]AndrewAvenue has 119 friends.
thanks!!!
by AndrewAvenue; ; Report