Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Huseynzade, Rafig
Format:	Preprint
Published:	2025
Subjects:	Computational Complexity Formal Languages and Automata Theory Logic in Computer Science 68Q15 (Primary) 68Q05, 68Q17, 03D15 (Secondary) F.1.3; F.1.1; F.4.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2510.08577