Skip to main content
Scour
Browse
Getting Started
Login
Sign Up
You are offline. Trying to reconnect...
Copied to clipboard
Unable to share or copy to clipboard
Formal Languages
📐 Formal Languages
automata theory, grammars, parsing, Chomsky hierarchy
Filter Results
Timeframe
Fresh
Past Hour
Today
This Week
This Month
Feeds to Scour
Subscribed
All
Scoured
32
posts in
6.1
ms
Show HN:
TuringLLM
– a LLM-powered Universal Turing
machine
💬
LLMs
Content type:
Code
github.com
·
5d
5 days ago
·
Hacker News
Actions for Show HN: TuringLLM – a LLM-powered Universal Turing machine
An Empirical Comparison of General
Context-Free
Parsers
💬
LLMs
Content type:
Academic
arxiv.org
·
2d
2 days ago
·
Hacker News
Actions for An Empirical Comparison of General Context-Free Parsers
Learning Regular
Languages
with the TTT Algorithm
💬
LLMs
rahul.gopinath.org
·
2d
2 days ago
·
Hacker News
Actions for Learning Regular Languages with the TTT Algorithm
Ezi_gex — a Unicode-aware
regex
engine for Zig, with comptime compilation and pluggable backends
✓
Formal Verification
ziggit.dev
·
3d
3 days ago
Actions for Ezi_gex — a Unicode-aware regex engine for Zig, with comptime compilation and pluggable backends
Co-Creator
of Haskell: Functional Programming, Thinking in Types, Useless
Languages
| Simon Jones
✓
Formal Verification
Content type:
News
developing.dev
·
2d
2 days ago
Actions for Co-Creator of Haskell: Functional Programming, Thinking in Types, Useless Languages | Simon Jones
Turing
universal neural networks do not require global clocks
🧩
Neural-Symbolic AI
Content type:
Academic
nature.com
·
6d
6 days ago
·
Hacker News
Actions for Turing universal neural networks do not require global clocks
Asynchronous AI cuts computing energy by orders of magnitude while learning continuously
🧩
Neural-Symbolic AI
techxplore.com
·
2d
2 days ago
Actions for Asynchronous AI cuts computing energy by orders of magnitude while learning continuously
On Architecture Research
📊
Prediction Markets
plugyawn.com
·
5d
5 days ago
Actions for On Architecture Research
The Birth of ‘Artificial Intelligence’
🧩
Neural-Symbolic AI
dartmouthalumnimagazine.com
·
1d
1 day ago
Actions for The Birth of ‘Artificial Intelligence’
Feature Fridays, 5th Jun 2026
🃏
Imperfect Information Games
Content type:
Blog
i-am-awake.itch.io
·
5d
5 days ago
Actions for Feature Fridays, 5th Jun 2026
Less-relevant results
A Mike's-Eye View of ARC's Research
🧪
Agent Evaluation
lesswrong.com
·
1d
1 day ago
Actions for A Mike's-Eye View of ARC's Research
New comment by ashutosh000018 in "Ask HN: Who wants to be hired? (June 2026)"
🧩
Neural-Symbolic AI
portfolio-phi-red-69.vercel.app
·
5d
5 days ago
·
Hacker News
Actions for New comment by ashutosh000018 in "Ask HN: Who wants to be hired? (June 2026)"
𖡼⚪𖡗⚪𔗢⚪𖡗⚪𖡼◦୦◦◯◦୦◦⠀⠀⠀⠀⠀⠀◦୦◦◯◦୦◦𖡼⚪𖡗⚪𔗢⚪𖡗⚪𖡼 ƎϽИƎꓨI⅃ƎTИI ƎVIƧƎIOꟼOTUA AUTOPOIESIVE INTELIGENCE 𖡼⚪𖡗⚪𔗢⚪𖡗⚪𖡼◦୦◦◯◦୦◦⠀⠀⠀⠀⠀⠀◦୦◦◯◦୦◦𖡼⚪𖡗⚪𔗢⚪𖡗⚪�
🧩
Neural-Symbolic AI
ghostarchive.org
·
6d
6 days ago
Actions for 𖡼⚪𖡗⚪𔗢⚪𖡗⚪𖡼◦୦◦◯◦୦◦⠀⠀⠀⠀⠀⠀◦୦◦◯◦୦◦𖡼⚪𖡗⚪𔗢⚪𖡗⚪𖡼 ƎϽИƎꓨI⅃ƎTИI ƎVIƧƎIOꟼOTUA AUTOPOIESIVE INTELIGENCE 𖡼⚪𖡗⚪𔗢⚪𖡗⚪𖡼◦୦◦◯◦୦◦⠀⠀⠀⠀⠀⠀◦୦◦◯◦୦◦𖡼⚪𖡗⚪𔗢⚪𖡗⚪�
Human-Like Neural Nets by Catapulting
🧩
Neural-Symbolic AI
gwern.net
·
4d
4 days ago
·
Hacker News
Actions for Human-Like Neural Nets by Catapulting
On the Complexity of the Bi-infinite Post Correspondence Problem
✓
Formal Verification
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for On the Complexity of the Bi-infinite Post Correspondence Problem
The Future Is Undecidable. Duty Is Not.
🃏
Imperfect Information Games
Content type:
Blog
dhanjit.me
·
3d
3 days ago
·
Hacker News
Actions for The Future Is Undecidable. Duty Is Not.
Focus is Motivation
🌳
Decision-Time Planning
Content type:
Blog
scotthyoung.com
·
6d
6 days ago
Actions for Focus is Motivation
Palindrome complexity versus factor complexity
💬
LLMs
Content type:
Academic
arxiv.org
·
2d
2 days ago
Actions for Palindrome complexity versus factor complexity
Weighing Timed Regular
Languages
: The Final Step (long version)
✓
Formal Verification
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for Weighing Timed Regular Languages: The Final Step (long version)
Compiling Rewrite Rules to
Finite-State
Transducers with the Worsening Trick
✓
Formal Verification
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for Compiling Rewrite Rules to Finite-State Transducers with the Worsening Trick
Page 2 »
Log in to enable infinite scrolling
Keyboard Shortcuts
Navigation
Next / previous item
j
/
k
Open post
o
or
Enter
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
g
h
Interests
g
i
Feeds
g
f
Likes
g
l
History
g
y
Changelog
g
c
Settings
g
s
Browse
g
b
Search
/
Pagination
Next page
n
Previous page
p
General
Show this help
?
Submit feedback
!
Close modal / unfocus
Esc
Press
?
anytime to show this help