The logic of interactive Turing reduction
Giorgi Japaridze
Abstract
The paper gives a soundness and completeness proof for the implicative fragment of intuitionistic calculus with respect to the semantics of computability logic, which understands intuitionistic implication as interactive algorithmic reduction. This concept -- more precisely, the associated concept of reducibility -- is a generalization of Turing reducibility from the traditional, input/output sorts of problems to computational tasks of arbitrary degrees of interactivity. See http://www.cis.upenn.edu/~giorgi/cl.html for a comprehensive online source on computability logic.
Create a lesson
Related papers
Challenging Benchmarks for Diagrammatic Equivalence of Circuits in TPTP and SMT-LIB
Julie Cailler, Noé Delorme, Sophie Tourret
Dynamic Polyhedral Logic
Nick Bezhanishvili, Laura Bussi, Vincenzo Ciancia et al.
Exact SAT and Constraint Programming for Job Shop Scheduling with Time-Varying Peak Power Constraints
Huy Tuan Nguyen, Duc Trung Kim Nguyen, Khanh To Van
Cycle time minimization for the simple assembly line balancing problem under peak power constraints
Bao Gia Hoang, Tuyen Van Kieu, Khanh Van To
Design and Empirical Characterization of a Hardware-Realized Turing Machine with Automated Card-Based Programming
Agrima Regmi, Jenish Pant, Pratistha Sapkota et al.
Comparison Invariants for Verifying Control Invariance
Promit Panja, André Platzer