TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Is Type Theory Turing Complete?

2 pointsby dalyover 1 year ago
I&#x27;m working with interval arithmetic.<p>Intervals have the annoying arithmetic behavior of tending to get wider. So [1..3]+[2..5] ends up with [1..8]<p>On the other hand, if I&#x27;m trying to compute the &quot;cover&quot; of an area this tendency to cover more area is what I want.<p>On the third hand, it seems that singleton intervals mirror arithmetic. So [1..1]+[2..2] ends up with [3..3]. Since I have addition it seems I get multiplication.<p>Which leads me to the question... is type theory turing complete? Can I compute any result using only types? Can I create a &quot;type computer&quot;?

1 comment

andrew_jhnson_4over 1 year ago
Not if the system is strongly normalizing, which most type systems aim for as a design objective: <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Normal_form_(abstract_rewriting)" rel="nofollow noreferrer">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Normal_form_(abstract_rewritin...</a>