2024-08-02

fanf: (Default)

https://dotat.at/@/2024-08-02-turing-c.html

Yesterday there was some discussion on the Orange Site about whether or not C is Turing complete. The consensus in the StackOverflow question is,

  • no, because the C abstract machine is a (large) finite state machine,

  • or maybe yes, if you believe that unaddressable local variables can exist outside the finite address space.

My answer is definitely yes, if you include the standard IO library.

And using IO is much closer to Turing's original model of a finite state machine working on unbounded storage.

Read more... )

June 2025

S M T W T F S
1234567
8 91011121314
15161718192021
22232425 262728
2930     

Most Popular Tags

Page Summary

Style Credit

Expand Cut Tags

No cut tags
Page generated 2025-07-01 13:23
Powered by Dreamwidth Studios