Live data from Hacker News

Cities: Skylines Is Turing Complete

medium.com

121–124 of 124 posts

Re: Cities: Skylines Is Turing Complete

#121

Earlier quoted context omitted.

The performance is a fraction of that on Windows though, from my experience.

Might this be a memory issue? I run it on Xubuntu and noticed it sometimes uses all my 8GB RAM so the PC starts swapping.

It loves RAM (and probably RAM speed), but not necessarily in a bad way. Jumping to 16gb (2x8gb) from 8gb (1x8gb) on the laptop I first played it on was a big jump in performance even with a GT740.

Re: Cities: Skylines Is Turing Complete

#122

Earlier quoted context omitted.

Not really, the base game is well worth it on its own, especially at sale price

Plus, is there a lot in the DLC that hasn't been added back in the Steam Workshop?

not entirely sure I follow the question. But if I'm reading you right, yes, a lot of DLC features and "quality of life" improvements originally started as mods, which are still available.

Re: Cities: Skylines Is Turing Complete

#123
post #89
post #23

If anyone is looking to buy this game, it's currently on sale at Humble Bundle for $7.50. https://www.humblebundle.com/store/cities-skylines

Any experience running it on Linux? Using Wine?

I tried installing it on Ubuntu MATE, GPD Pocket 2, with whatever the display-scaling default is for this distro. There is some stupid bug where I can't get past the privacy-policy adhesion agreement because it is rendered mostly off screen and doesn't recognize keyboard input. Classic Linux desktop paper-cut that I'm sure I could resolve with 15-240 minutes of web research.

Other than that, I assume the Linux version is fine.

Re: Cities: Skylines Is Turing Complete

#124
post #85

Doesn't Turing completeness require conditional loops? Considering the fact that he has AND and OR gates he can represent conditionals, but he doesn't show it. And the fact that it always terminates by design also means it solves the halting problem which by definition means it isn't Turing complete (I think?).

What do you mean by "it always terminates by design?" However, as the comments to the post say, the author should provide a proof that the "game physics" allows to construct a functioning latch from these logic gates. Conditional loops are not essential: the lambda calculus is TC despite lacking any loop primitives.

Thanks for the clarification! It's been a while since I've looked at Turing completeness.
Post reply on HN