[ Followup-To: set ]
In comp.theory Dude <punditster@gmail.com> wrote:
[ .... ]
You can use restricted programming languages or subsets (such as MISRA
C, SPARK, or Rocq) that are not fully Turing-complete.
MISRA C is turing-complete, just as C is. I don't know about the
others, but it is likely they are turing-complete too.
MISRA C is a subset of C which supposedly reduces error possibilities,
at the expense of bloat.
| Sysop: | Amessyroom |
|---|---|
| Location: | Fayetteville, NC |
| Users: | 76 |
| Nodes: | 6 (0 / 6) |
| Uptime: | 57:39:49 |
| Calls: | 1,265 |
| Calls today: | 1 |
| Files: | 1,362 |
| D/L today: |
4 files (9,632K bytes) |
| Messages: | 285,926 |