Authors: Giorgos Bougioukas
This paper proves that for every instance of the (NP-complete or NP-hard, depending on the version) change-making problem (CMP) an one-dimensional cellular automaton can be constructed that solves it. As cellular automata are graphically represented as images or sequences of images - often resembling natural phenomena such as fluid flows - a possibly interesting graphical representation of NP-completeness can be obtained.
Comments: 7 Pages. 18 figures
Download: PDF
[v1] 2016-11-06 13:09:50
Unique-IP document downloads: 47 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.