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  7995 reads

Browse archivesActive forum topics 
Recent comments
4 hours 47 min ago
5 hours 8 min ago
6 hours 55 min ago
6 hours 58 min ago
6 hours 59 min ago
7 hours 6 min ago
7 hours 30 min ago
7 hours 39 min ago
7 hours 44 min ago
7 hours 57 min ago