Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Tom Altman

Tom Altman

2 indexed papers

Recent (6 mo)
2
With code
0
Influential cites
0
Benchmarked
0

Publications per year

2
26

Top categories

Complexity×2

Research Timeline

2026
Fixed Points, a Predictor-Impossibility Theorem, and Applications

This paper introduces an activation hierarchy and proves a Predictor-Impossibility Theorem, showing that no effective predictor family can determine all stage languages. It also establishes a slice theorem connecting aggregate inputs to individual stage languages, and shows that MIS, an aggregate language, is in NP-P.

Predictor-Impossibility Theorem and Applications

This paper introduces a hierarchy and proves a Predictor Impossibility Theorem, defining an aggregate language MIS and establishing a connection between aggregate inputs and individual stage languages, leading to a result connecting polynomial-time decidability of MIS to the existence of an effective predictor family.

Highlighted terms show continued research focus across papers

Papers

cs.CCTheoreticalRecentAug 6, 2026

Predictor-Impossibility Theorem and Applications

Tom Altman

This paper introduces a hierarchy and proves a Predictor Impossibility Theorem, defining an aggregate language MIS and establishing a connection between aggregate inputs and individual stage languages…

View →
cs.CCTheoreticalRecent
Jul 8, 2026

Fixed Points, a Predictor-Impossibility Theorem, and Applications

Tom Altman

This paper introduces an activation hierarchy and proves a Predictor-Impossibility Theorem, showing that no effective predictor family can determine all stage languages. It also establishes a slice th…

View →