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

Browse archivesActive forum topics 
Recent comments
2 hours 25 min ago
13 hours 23 min ago
19 hours 12 min ago
19 hours 32 min ago
20 hours 2 min ago
20 hours 48 min ago
21 hours 12 min ago
21 hours 40 min ago
23 hours 13 min ago
23 hours 38 min ago