[ 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: | Jacob Catayoc |
|---|---|
| Location: | Pasay City, Metro Manila, Philippines |
| Users: | 5 |
| Nodes: | 4 (0 / 4) |
| Uptime: | 498678:04:52 |
| Calls: | 212 |
| Calls today: | 3 |
| Files: | 912 |
| D/L today: |
31 files (22,593K bytes) |
| Messages: | 69,856 |