Konsep Dasar Algoritma, Aturan Algoritma dalam Komputasi, Notasi Matematika di dalam Algoritma, Analisa Algoritma, Design Algoritma
Download
0.89 Mb.
Page
4/7
Date
20.03.2022
Size
0.89 Mb.
#58472
1
2
3
4
5
6
7
11-turing-machine
Turing
Machine Conventions
a, b, ... are input symbols.
..., X, Y, Z are tape symbols.
..., w, x, y, z are strings of input symbols.
,...
are strings of tape symbols
Language
accepted by Turing machine
The turing machine accepts all the language even though they are recursively enumerable. Recursive means repeating the same set of rules for any number of times and enumerable means a list of elements.
The TM also accepts
the computable functions
,
such as addition
,
multiplication
,
subtraction
,
division
,
power function
, and many more.
Download
0.89 Mb.
Share with your friends:
1
2
3
4
5
6
7
The database is protected by copyright ©ininet.org 2024
send message
Main page
Guide
Instructions
Report
Request
Review