Thumbnail
Access Restriction
Subscribed

Author Hooper, Philip K.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1966
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract A natural problem, related to the (known unsolvable) halting problem for Post normal systems, arises when one considers, for a given Post normal system, whether the system halts (eventually) on $\textit{every}$ word over its alphabet. For polygenic systems, this problem is shown to be recursively unsolvable by constructing a reduction from the “Domino Problem.”
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1966-10-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 13
Issue Number 4
Page Count 6
Starting Page 594
Ending Page 599


Open content in new tab

   Open content in new tab
Source: ACM Digital Library