cs.CC · 2026-11-05 · No. 164

Computational Complexity, 2026-11-05.

1 new papers in cs.CC. Titles, authors, abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →

01 — The papers

1 entries
  1. 01

    An Engineering Reading of the Bounded Halting Problem and Observable Properties of a Universal Machine

    Sergey Salishev

    cs.CC · cs.AI · cs.FL · math.LO

    The halting problem asks whether a program eventually halts, with unrestricted resources. Engineering systems instead certify bounded halting: given a program, an input, and a step budget T, decide whether the program halts within T steps. This paper studies two of its uses. First, it defines an exact finite-budget problem, placing the simulated program and the checker on the same unit-cost timescale, so the checker can be embedded in an...

    arxiv.org/abs/2611.06303 · PDF

This edition is part of The Daily Abstract — cs.CC archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.