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

Browse archivesActive forum topics 
Recent comments
7 hours 46 min ago
8 hours 24 min ago
10 hours 57 min ago
12 hours 47 min ago
13 hours 20 sec ago
13 hours 7 min ago
14 hours 26 min ago
14 hours 42 min ago
15 hours 42 min ago
15 hours 45 min ago