Paper Info
Title
CCS(25, 12) is Turing-complete.
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.
Year
DOI
Venue
2017
10.3233/FI-2017-1557
FUNDAMENTA INFORMATICAE
Keywords
DocType
Volume
Process Algebra,CCS,Universal Turing Machine
Journal
154
Issue
ISSN
Citations 
1-4
0169-2968
0
PageRank 
References 
Authors
0.34
0
1
Name
Order
Citations
PageRank
Roberto Gorrieri12297184.63