NBUMP: Difference between revisions
CSV import Tags: mobile edit mobile web edit |
CSV import |
||
| Line 34: | Line 34: | ||
[[Category:Computational theory]] | [[Category:Computational theory]] | ||
{{computing-stub}} | {{computing-stub}} | ||
<gallery> | |||
File:NBUMP.png|NBUMP | |||
</gallery> | |||
Latest revision as of 01:40, 20 February 2025
NBUMP (Non-Binary Universal Machine Programming) is a programming language that is designed to be used on a Universal Turing Machine (UTM). It is a low-level programming language that provides a set of basic instructions that can be combined to create complex programs.
Overview[edit]
NBUMP was developed as a way to simplify the process of programming a UTM. It provides a set of basic instructions that can be combined in various ways to create complex programs. These instructions are designed to be simple and easy to understand, making it easier for programmers to write and debug their programs.
Instructions[edit]
NBUMP instructions are based on the concept of a state machine. Each instruction specifies a state, a symbol to be written on the tape, and a direction to move the tape. The state is used to control the flow of the program, while the symbol and direction are used to manipulate the data on the tape.
Syntax[edit]
The syntax of NBUMP is designed to be simple and easy to understand. Each instruction is written on a separate line, and consists of three parts: the state, the symbol, and the direction. The state and symbol are specified as integers, while the direction is specified as either 'L' for left or 'R' for right.
Example[edit]
Here is an example of a simple NBUMP program:
``` 1 0 R 1 1 L 0 1 R ```
This program starts in state 1, writes a 0 on the tape and moves right. Then it stays in state 1, writes a 1 on the tape and moves left. Finally, it moves to state 0, writes a 1 on the tape and moves right.
See also[edit]
-
NBUMP
