This paper introduces a novel model for characterizing regularity in functions, extending existing Nerode-style approaches. The proposed model accommodates functions with arbitrary output domains, moving beyond traditional Boolean outputs. It models computation by splitting input strings between two cooperating parties, Alice and Bob, who exchange messages to determine the function's output. The authors conjecture this framework can provide regularity characterizations for domains currently lacking them, offering supporting evidence and exploring extensions to infinite alphabets. AI
RANK_REASON The item is an academic paper on arXiv detailing a new theoretical model for computation. [lever_c_demoted from research: ic=1 ai=0.4]
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →