Computability by nondeterministic program and the Moschovakis search computability

DOI10.1007/BF02110569MaRDI QIDQ1905256zbMATH OpenOpenAlexFDO

Authors 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

• Abstract First Order Computability. I
• Classical recursion theory. The theory of functions and sets of natural numbers
• Finite alogorithmic procedures and computation theories.
• scientific article; zbMATH DE number 3685474 (Why is no real title available?)
• scientific article; zbMATH DE number 3349780 (Why is no real title available?)
• On Classes of Program Schemata
• Prime and Search Computability, Characterized as Definability in Certain Sublanguages of Constructible L ω1, ω

Cited in

(5)

• scientific article; zbMATH DE number 4145891 (Why is no real title available?)
• scientific article; zbMATH DE number 4051602 (Why is no real title available?)
• scientific article; zbMATH DE number 2084366 (Why is no real title available?)
• scientific article; zbMATH DE number 947381 (Why is no real title available?)
• Universality and semicomputability for nondeterministic programming languages over abstract algebras

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1905256)