Computability by nondeterministic program and the Moschovakis search computability

DOI10.1007/BF02110569zbMath0838.68033OpenAlexW2012609583MaRDI QIDQ1905256

V. D. Solov'ev

Publication date: 27 May 1996

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02110569

zbMATH Keywords

computability by nondeterministic programs

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Classical recursion theory. The theory of functions and sets of natural numbers
• Finite alogorithmic procedures and computation theories.
• Prime and Search Computability, Characterized as Definability in Certain Sublanguages of Constructible L ω1, ω
• Abstract First Order Computability. I
• On Classes of Program Schemata

This page was built for publication: Computability by nondeterministic program and the Moschovakis search computability