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

Browse archivesActive forum topics 
Recent comments
1 hour 23 min ago
4 hours 47 min ago
6 hours 57 min ago
7 hours 10 min ago
7 hours 37 min ago
10 hours 23 min ago
10 hours 23 min ago
12 hours 19 min ago
12 hours 24 min ago
12 hours 45 min ago