Tom Altman
2 indexed papers
Publications per year
Top categories
Research Timeline
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.
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.
Papers
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…