Computability

∞ Computability

computability theory, Turing machines, decidability, halting problem

Feeds to Scour
SubscribedAll
Scoured 1 posts in 8.5 ms

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

 🧩Complexity Theory  Content type: Academic
arxiv.org·

No more posts from friedrice's subscribed feeds.

Scour all 25255 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