Skip to content

Simple C++ Turing Machine implementation to conduct research on the busy beaver problem

License

Notifications You must be signed in to change notification settings

christophschnabl/turing_machine

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

21 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

turing_machine

Simple C++ Turing Machine implementation

Build

mkdir build
cd build
cmake ..
make

Run

  1. after building the executable can be found in the /build directory
  2. ./turing_machine <configuration-file>

Configuration File

Import Configuration as a textfile. Place it in the /build directory or anywhere else as long as you know the path ;)

Examples:

2-state-busy-beaver (see : https://en.wikipedia.org/wiki/Busy_beaver)

0 1 2  
0 
-
2 
0 1
0
0 0 1 1 R
0 1 1 1 L
1 0 0 1 L
1 1 2 1 R
states as integers - seperated by spaces
start state as integer
input alphabet (- if empty)
end states as integers - seperated by spaces
tape alphabet (cannot be empty)
blank symbol (must be from tape alphabet)
turing machine configuration as quintuple (q, s, q', s', d) - elements seperated by spaces
where q = current state, s = current_symbol, q = next_state, s = symbol to write and d is direction in which to move the R/W head (R, L, N)

About

Simple C++ Turing Machine implementation to conduct research on the busy beaver problem

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published