I often read on the Internet - and I realise that I should know by now that it's not a good place to read things - that Idris isn't Turing Complete and can't be because it's dependently typed. I think I can guess where this idea comes from, but, in case of any doubt, it's Turing Complete. Of course it's Turing Complete. For goodness sake...
=> More informations about this toot | More toots from edwinb@types.pl
I once implemented Whitespace in Idris because I was the right sort of bored. People are happy to believe Whitespace is Turing Complete but Idris? No, couldn't possibly be, I mean it's dependently typed isn't it? (Of course it is. Stop it.)
=> More informations about this toot | More toots from edwinb@types.pl
Turing Completeness is overrated anyway. Pacman Completeness is where it's at.
=> More informations about this toot | More toots from edwinb@types.pl
@edwinb Tetris Complete is also a concept I've used when discussing expressive power
=> More informations about this toot | More toots from tfb@functional.cafe
@edwinb this is a pin-worthy toot (i say, having gone looking for it nearly a month after the fact)
=> More informations about this toot | More toots from chrisamaphone@hci.social
@chrisamaphone That hadn't occurred to me, but yes I think it probably is isn't it?
=> More informations about this toot | More toots from edwinb@types.pl
@edwinb Admit it: you only say that because Pacman completeness is much more fun to test than Turing completeness!
=> More informations about this toot | More toots from tristrambrelstaff@mathstodon.xyz This content has been proxied by September (3851b).Proxy Information
text/gemini