Graph Oriented Fictional Computer
| Designed by | Andriy |
|---|---|
| Appeared in | 2023 |
| Computational class | Turing-complete |
| Major implementations | itch.io download link |
| Dialects | None |
| File extension(s) | .xml |
Graph Oriented fictional computer is a fictional computer with a graph-based memory as opposed to a linear one. It was designed by User:Andriy who also implemented an emulator in Java. Each node is referred to by a capital English letter, and each node can have up to 26 child nodes which are also referred as a capital English letter. In the context of this fictional computer, the address of a node refers to the path you have to go through in order to reach it. For example child C of child B of node A is a node with the address ABC. Using the command redirect, it's possible for a node to have multiple correct addresses. Each node can store a one byte value. However, values that take larger space can also be stored by utilizing the child node C, then CC, and so on. It's possible to store strings, 8 bit integers which can be stored as big endian or as little endian, and fractions (like double variables in Java).
This fictional computer can be considered as having one esoteric programming language or two closely related ones. The first one is