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
CS
💻 CS
Broad
computer science, automata, theory, computation
Filter Results
Timeframe
Fresh
Past Hour
Today
This Week
This Month
Feeds to Scour
Subscribed
All
Scoured
132
posts in
58.6
ms
Passive Learning of Symbolic
Automata
over Monotonic Algebras
⚙
Automata Theory
Content type:
Academic
arxiv.org
·
5d
5 days ago
Actions for Passive Learning of Symbolic Automata over Monotonic Algebras
Why Compiler Engineers Rarely Use Strassen's
Algorithm
for Fast Matrix Multiplications
⚡
Parallel Computing
Content type:
News
Content type:
Blog
leetarxiv.substack.com
·
2d
2 days ago
·
Substack
,
r/programming
Actions for Why Compiler Engineers Rarely Use Strassen's Algorithm for Fast Matrix Multiplications
Learning Regular
Languages
with the TTT
Algorithm
🎯
Automata theory
rahul.gopinath.org
·
1d
1 day ago
·
Hacker News
Actions for Learning Regular Languages with the TTT Algorithm
Show HN:
TuringLLM
– a LLM-powered Universal Turing
machine
⚙
Automata Theory
Content type:
Code
github.com
·
4d
4 days ago
·
Hacker News
Actions for Show HN: TuringLLM – a LLM-powered Universal Turing machine
Generalizing LCL
Complexity
Gaps to Unbounded Degree via Monadic Second-Order Properties
⚙
Automata Theory
Content type:
Academic
arxiv.org
·
14h
14 hours ago
Actions for Generalizing LCL Complexity Gaps to Unbounded Degree via Monadic Second-Order Properties
Layer Order Semantics for
Automata-Based
Cybersecurity
⚙
Automata Theory
Content type:
Academic
arxiv.org
·
14h
14 hours ago
Actions for Layer Order Semantics for Automata-Based Cybersecurity
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.
⚔️
Lean Theorem
Content type:
Code
github.com
·
5d
5 days ago
·
Hacker News
Actions for 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.
Weighing Timed Regular
Languages
: The Final Step (long version)
⚙
Automata Theory
Content type:
Academic
arxiv.org
·
14h
14 hours ago
Actions for Weighing Timed Regular Languages: The Final Step (long version)
Dynamics in a Low-Rank Separable Field Cellular
Automaton
🔲
Cellular Automata
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for Dynamics in a Low-Rank Separable Field Cellular Automaton
On the
Complexity
of the Bi-infinite Post Correspondence Problem
🧮
Theoretical Computer Science
Content type:
Academic
arxiv.org
·
14h
14 hours ago
Actions for On the Complexity of the Bi-infinite Post Correspondence Problem
A remark on diagnosability verification
⚙
Automata Theory
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for A remark on diagnosability verification
Causally Evaluating the Learnability of
Formal
Language
Tasks
⚙
Automata Theory
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for Causally Evaluating the Learnability of Formal Language Tasks
Decentralized EM
Algorithm
for Gaussian Mixtures under Data Heterogeneity and Partial Labeling
🔒
Privacy Preserving
Content type:
Academic
arxiv.org
·
6d
6 days ago
Actions for Decentralized EM Algorithm for Gaussian Mixtures under Data Heterogeneity and Partial Labeling
Complexity
and
Algorithms
for Unary Translocation Distance
🧮
Theoretical Computer Science
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for Complexity and Algorithms for Unary Translocation Distance
𝜇𝜆ϵ
𝛿-Calculus
: A Self Optimizing
Language
that Seems to Exhibit Paradoxical Transfinite Cognitive Capabilities
💻
Programming languages
Content type:
Academic
arxiv.org
·
1d
1 day ago
·
Lobsters
Actions for 𝜇𝜆ϵ𝛿-Calculus: A Self Optimizing Language that Seems to Exhibit Paradoxical Transfinite Cognitive Capabilities
Correct-by-Construction Design of Timed Systems in Event-B
🔬
Logic in Computer Science
Content type:
Academic
arxiv.org
·
5d
5 days ago
Actions for Correct-by-Construction Design of Timed Systems in Event-B
An Empirical Comparison of General Context-Free Parsers
⚙
Automata Theory
Content type:
Academic
arxiv.org
·
1d
1 day ago
·
Hacker News
Actions for An Empirical Comparison of General Context-Free Parsers
Palindrome
complexity
versus factor
complexity
⚙
Automata Theory
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for Palindrome complexity versus factor complexity
Detecting Large Quasi-cliques on Dynamic Networks
🧮
Theoretical Computer Science
Content type:
Academic
arxiv.org
·
5d
5 days ago
Actions for Detecting Large Quasi-cliques on Dynamic Networks
Network node immunization: improving Netshield
algorithm
through random rooted forests
📐
Linear Algebra
Content type:
Academic
arxiv.org
·
6d
6 days ago
Actions for Network node immunization: improving Netshield algorithm through random rooted forests
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