Computability

Feeds to Scour
SubscribedAll
Scoured 30 posts in 5.8 ms

Four intuitionistic modal connectives

 Logic  Content type: Academic
arxiv.org·

TiruArt/Pedigree-Polytopes-Lean4: Lean 4 machine-verified proof that Membership Problem for Pedigree Polytopes, M3P ∈ P and P = NP via properties of Pedigree Polytopes.

 λLambda Calculus  Content type: Code
github.com··Hacker News

When Types Intersect and Effects Get Handled

 λType Theory  Content type: Academic
arxiv.org·

MechLens: Late Crystallization of Factual Knowledge Explains Intervention Effectiveness in Language Models

 Category Theory  Content type: Academic
arxiv.org·

Provably Auditable and Safe LLM Agents from Human-Authored Ontologies

 λLambda Calculus  Content type: Academic
arxiv.org·

Learning to Strategically Acquire Resources in Competition

 🔷Functional Programming  Content type: Academic
arxiv.org·

Incremental Computation for Efficient Programmable Inference in Probabilistic Programs

 λLambda Calculus  Content type: Academic
arxiv.org·

Negative and Fractional Types in the Fidelity Framework

 🔷Functional Programming  Content type: Academic
arxiv.org·

Entropy-Compatible Barrier Schemes for Diffusive FENE Flows

 λLambda Calculus  Content type: Academic
arxiv.org·

When Firms Learn to Game the Rules

 λType Theory  Content type: Academic
arxiv.org·

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