User loginNavigation |
Most powerful terminating semantics?I was curious if there was any sort of consensus for what the most powerful semantics known so far that are still guaranteed to only allow one to write programs that terminate? Phrased another way, languages that are "as close as possible to being Turing complete without actually being Turing complete." Most powerful in this context meaning something like, "the language for which their exists a function mapping all possible programs written in it to equivalent programs in the domain of all-possible-programs-that-could-be-written-in-a-Turing-complete-language with the largest image compared to all other such functions for other languages". By dataangel at 2009-06-25 20:30 | LtU Forum | previous forum topic | next forum topic | other blogs | 16353 reads
|
Browse archivesActive forum topics
|
Recent comments
1 week 21 hours ago
1 week 5 days ago
1 week 6 days ago
1 week 6 days ago
2 weeks 5 days ago
3 weeks 1 day ago
3 weeks 1 day ago
3 weeks 1 day ago
4 weeks 3 days ago
4 weeks 4 days ago