English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In the preprint mentioned in the title Mr. Tianrong claims to prove$\textrm{NSPACE}[n]\neq\textrm{DSPACE}[n]$, resolving a longstanding openproblem in automata theory called the LBA question. He claims to achieve thisby showing more generally $\textrm{NSPACE}[S(n)]\neq\textrm{DSPACE}[S(n)]$ forsuitable $S(n)$. We demonstrate that his proof is incomplete, even wrong, andhis strategy cannot be repaired.  Update to include recent developments of Mr. Tianrong's preprint.

Refuting Tianrong Lin's arXiv:2110.05942 "Resolution of The Linear-Bounded Automata Question"