ON THE COMPUTING POWER OF PROGRAMS WITH SETS

DOI10.1142/S0129054192000115zbMath0754.68051OpenAlexW2034004280MaRDI QIDQ4020486

Alexei P. Stolboushkin

Publication date: 16 January 1993

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054192000115

zbMATH Keywords

data complexitycomputability over abstract structuresglobal predicatessemi-universal classes

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Complexity of computation (including implicit computational complexity) (03D15) Model theory of finite structures (03C13) Data structures (68P05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computability and recursion theory (03D99)