Computability Theory

Feeds to Scour
SubscribedAll
Scoured 10 posts in 15.9 ms

Show HN: TuringLLM – a LLM-powered Universal Turing machine

 💻CS  Content type: Code
github.com··Hacker News

The Future Is Undecidable. Duty Is Not.

 💻CS  Content type: Blog
dhanjit.me··Hacker News

On the Complexity of the Bi-infinite Post Correspondence Problem

 💻CS  Content type: Academic
arxiv.org·

Turing universal neural networks do not require global clocks

 💻CS  Content type: Academic
nature.com··Hacker News

Subversion-Resistance for Free from Formal Verification

 🌐NetworkProtocols
lesswrong.com·
Less-relevant results

Human-Like Neural Nets by Catapulting

 💻CS
gwern.net··Hacker News

𝜇⁢𝜆⁢ϵ⁢𝛿-Calculus: A Self Optimizing Language that Seems to Exhibit Paradoxical Transfinite Cognitive Capabilities

 💻CS  Content type: Academic
arxiv.org··Lobsters

A Mike's-Eye View of ARC's Research

 💻CS
lesswrong.com·

Worst-Case Update Complexity of the Preisach Extremum Stack

 🌲CTL  Content type: Academic
arxiv.org·

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption

 💻CS  Content type: Academic
arxiv.org·

No more posts from tiferrei's subscribed feeds.

Scour all 25257 feedsLearn more about Feeds

Keyboard Shortcuts

Navigation

Next / previous item
j/k
Open post
oorEnter
Preview post
v

Post Actions

Love post
a
Like post
l
Dislike post
d
Undo reaction
u
Save / unsave
s

Recommendations

Add interest / feed
Enter
Not interested
x

Go to

Home
gh
Interests
gi
Feeds
gf
Likes
gl
History
gy
Changelog
gc
Settings
gs
Browse
gb
Search
/

General

Show this help
?
Submit feedback
!
Close modal / unfocus
Esc

Press ? anytime to show this help