Search Computability and Computability with Numberings Are Equivalent in the Case of Finite Set of Objects

Angel V. Ditchev
Additional contact information
Angel V. Ditchev: High Pedagogical Institute

A chapter in Mathematical Logic and Its Applications, 1987, pp 233-242 from Springer

Abstract: Abstract In the paper [1] Moschovakis has defined a concept about relative computability, which he called search computability. D. Skordev has defined another concept about relative computabi1ity, which he called admissibility. That concept is connected with partial recursivness. Similar definition of admissibility has been given by Lacombe [2], which he called ∀-recursiveness.

Date: 1987
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0897-3_15

Ordering information: This item can be ordered from
http://www.springer.com/9781461308973

DOI: 10.1007/978-1-4613-0897-3_15

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().