Yihong Zhang
@yihozhang.bsky.social
96 followers
120 following
2 posts
Programming languages and database systems.
Posts
Media
Videos
Starter Packs
Yihong Zhang
@yihozhang.bsky.social
· Jan 27
Can typed lambda calculi express *all* algorithms below a given complexity?
I know that the complexity of most varieties of typed lambda calculi without the Y combinator primitive is bounded, i.e. only functions of bounded complexity can be expressed, with the bound becoming
cstheory.stackexchange.com
Reposted by Yihong Zhang
Yaron Minsky
@yminsky.bsky.social
· Nov 22