9 ms·

Any physical machine cannot be Turing complete because it has a finite amount of RAM.

• fauigerzigerk 14y ago
  Sure, but we're talking about whether or not this particular style of C can be Turing complete and I'm not sure it is, even on a machine with an infinite amout of RAM.
  • jsight 14y ago
    A machine with an infinite amount of RAM can have an infinite stack size.
    • fauigerzigerk 14y ago
      C arrays that live on the stack have to be created with a constant size (at least before C99). It's a limitation of the language regardless of any machine or stack size.
      • Johngibb 14y ago
        If we're going to grant that a machine can have infinite ram, surely we can grant that a spec of C can have infinite stack allocated arrays... :)
        • deleted 14y ago
          [deleted]
    • sp332 14y ago
      That's already been granted in this argument. The question now is, given an infinite stack, is this programming style Turing-complete?
• Evbn 14y ago
  Address space is not limited by RAM. The only concern is fixed vs expandable width address.