Why can Conway’s Game of Life be classified as a universal machine?

I was recently reading about artificial life and came across the statement, “Conway’s Game of Life demonstrates enough complexity to be classified as a universal machine.” I only had a rough understanding of what a universal machine is, and Wikipedia only brought me as close to understanding as Wikipedia ever does. I wonder if anyone … Read more

Is the time complexity of the empty algorithm O(0)?

So given the following program: Is the time complexity of this program O(0)? In other words, is 0 O(0)? I thought answering this in a separate question would shed some light on this question. EDIT: Lots of good answers here! We all agree that 0 is O(1). The question is, is 0 O(0) as well? … Read more

When have you come upon the halting problem in the field? [closed]

Closed. This question is opinion-based. It is not currently accepting answers. Want to improve this question? Update the question so it can be answered with facts and citations by editing this post. Closed 7 years ago. Improve this question When have you ever personally come upon the halting problem in the field? This can be … Read more

Is the C99 preprocessor Turing complete?

After discovering the Boost preprocessor’s capabilities I found myself wondering: Is the C99 preprocessor Turing complete? If not, what does it lack to not qualify? Answer Well macros don’t directly expand recursively, but there are ways we can work around this. The easiest way of doing recursion in the preprocessor is to use a deferred … Read more