✦ LIBER ✦

Reduction of computable and potentially computable numerations

✍ Scribed by V. A. Uspenskii

Publisher: SP MAIK Nauka/Interperiodica
Year: 1969
Tongue: English
Weight: 314 KB
Volume: 6
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01450246

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the reducibility of computable numera

On the reducibility of computable numerations

✍ A. B. Khutoretskii 📂 Article 📅 1969 🏛 Springer US 🌐 English ⚖ 521 KB

Minimal numerations of positively comput

Minimal numerations of positively computable families

✍ S. A. Badaev 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 1019 KB

Derivatives of Computable Functions

✍ Ning Zhong 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 665 KB

## Abstract As is well known the derivative of a computable and __C__^1^ function may not be computable. For a computable and __C__∞ function __f__, the sequence {__f__^(__n__)^} of its derivatives may fail to be computable as a sequence, even though its derivative of any order is computable. In th

Nonanonymity and sensitivity of computab

Nonanonymity and sensitivity of computable simple games

✍ H. Reiju Mihara 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 135 KB

This paper investigates algorithmic computability of simple games (voting games). It shows that (i) games with a finite carrier are computable, (ii) computable games have both finite winning coalitions and cofinite losing coalitions, and (iii) computable games violate any conceivable notion of anony

Computable functionals and arithmetic of

Computable functionals and arithmetic of ordinal types

✍ V. A. Ganov 📂 Article 📅 1987 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 748 KB

A Comparison of Five “Computable” Operat

A Comparison of Five “Computable” Operators

✍ Marian Boykan Pour-El 📂 Article 📅 1960 🏛 John Wiley and Sons 🌐 English ⚖ 785 KB