Abstract
CCS(h,k) is the CCS subcalculus which can use at most h constants and k actions. We show that CCS(25,12) is Turing-complete by simulating Neary and Woods’ universal Turing machine with 15 states and 2 symbols.
Filter Results
Select search scope: search across all journals or within the current journal
Search this journal
Enter search terms…
/