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

Browse archivesActive forum topics 
Recent comments
10 hours 16 min ago
10 hours 54 min ago
12 hours 20 min ago
14 hours 24 min ago
15 hours 22 min ago
15 hours 39 min ago
16 hours 20 min ago
18 hours 5 min ago
21 hours 18 min ago
21 hours 21 min ago