CCS(25,12) is Turing-complete
Roberto Gorrieri · Fundamenta Informaticae · 2017
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.