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 allpossibleprogramsthatcouldbewritteninaTuringcompletelanguage with the largest image compared to all other such functions for other languages". By dataangel at 20090625 20:30  LtU Forum  previous forum topic  next forum topic  other blogs  14175 reads

Browse archivesActive forum topics
New forum topics

Recent comments
2 days 13 hours ago
4 days 7 hours ago
2 weeks 1 day ago
3 weeks 13 hours ago
4 weeks 11 hours ago
5 weeks 5 days ago
6 weeks 1 day ago
7 weeks 2 days ago
7 weeks 5 days ago
7 weeks 5 days ago