Complexity Theory of Randomised Testing
Randomised testing is a widely-used approach to software validation, yet its theoretical foundations remain thin. In particular, the fundamental question of what it means for a set of inputs to be \emph{generable} has gone unanswered in bot
https://arxiv.org/abs/2607.11811v1 ↗Thesis fit
Good fit
Within your typical scope; diligence still required.
In your usual scope
Idea match
Light
How close the company’s idea is to your thesis statement
Sector
ai
Overlap with sectors you care about
Geography
Unknown
Location unknown — scores 0
Your thesis: “We back exceptional technical founders building AI-first products and infrastructure, deploying $100K checks within 24 hours.”
Founder → stable
Traction → stable
Idea vs market → stable
▸ Add / edit details
Correct facts used on the next screening or memo.
People
P
Pingshi Yu
1.0
low confidence
C
Chengsong Tan
1.0
low confidence
N
Nicolas Wu
1.0
low confidence
A
Alastair Donaldson
1.0
low confidence
Activity & evidence
Similar baseline plays (YC · idea space)
testRigor
· Active
Executable specifications in English for test automation
founders not scraped yet
Confident AI
· Active
The LLM Eval and Observability Platform for AI Quality
founders not scraped yet
Abeer Agrawal