Refuting Tianrong Lin's arXiv:2110.05942 "Resolution of The Linear-Bounded Automata Question"
Abstract
In the preprint mentioned in the title Mr. Tianrong claims to prove NSPACE[n]≠DSPACE[n], resolving a longstanding open problem in automata theory called the LBA question. He claims to achieve this by showing more generally NSPACE[S(n)]≠DSPACE[S(n)] for suitable S(n). We demonstrate that his proof is incomplete, even wrong, and his strategy cannot be repaired. Update to include recent developments of Mr. Tianrong's preprint.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.