Review: V. A. Uspenskij, (Lekcii o vycislimyh funkciah)Lectures on Computable Functions [Book Review]

Journal of Symbolic Logic 31 (2):263-264 (1966)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2269825

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Review: A.I. Mal'cev, Polno numerovannye mnozestva (Complete Enumeration of a Set); A. I. Mal'cev, K teorii vycislimyh semejstv obektov (On the Theory of Computable Families of Objects); A. I. Mal'cev, Pozitivnye i negativnye numeracii (Positive and Negative Numerations). [REVIEW]Elliott Mendelson - 1970 - Journal of Symbolic Logic 35 (2):336-337.
Basic Reading on Computable Functions.Peter Smith - unknown
Derivatives of Computable Functions.Ning Zhong - 1998 - Mathematical Logic Quarterly 44 (3):304-316.
When series of computable functions with varying domains are computable.Iraj Kalantari & Larry Welch - 2013 - Mathematical Logic Quarterly 59 (6):471-493.
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Uniformly computable aspects of inner functions: estimation and factorization.Timothy H. McNicholl - 2008 - Mathematical Logic Quarterly 54 (5):508-518.
Review: A. N. Kolmogorov, V. A. Uspenskij, On the Definition of an Algorithm. [REVIEW]Elliott Mendelson - 1973 - Journal of Symbolic Logic 38 (4):655-655.
Bounded iteration and unary functions.Stefano Mazzanti - 2005 - Mathematical Logic Quarterly 51 (1):89-94.
Computability of measurable sets via effective topologies.Yongcheng Wu & Decheng Ding - 2006 - Archive for Mathematical Logic 45 (3):365-379.
Computable choice functions for computable linear orderings.Manuel Lerman & Richard Watnick - 2003 - Mathematical Logic Quarterly 49 (5):485-510.
The elementary computable functions over the real numbers: applying two new techniques. [REVIEW]Manuel L. Campagnolo & Kerry Ojakian - 2008 - Archive for Mathematical Logic 46 (7-8):593-627.
On a complexity-based way of constructivizing the recursive functions.F. W. Kroon & W. A. Burkhard - 1990 - Studia Logica 49 (1):133 - 149.
Formulas for Computable and Non-Computable Functions.Samuel Alexander - 2006 - Rose-Hulman Undergraduate Mathematics Journal 7 (2).
Algorithmic randomness of continuous functions.George Barmpalias, Paul Brodhead, Douglas Cenzer, Jeffrey B. Remmel & Rebecca Weber - 2008 - Archive for Mathematical Logic 46 (7-8):533-546.
Computable metrization.Tanja Grubba, Matthias Schröder & Klaus Weihrauch - 2007 - Mathematical Logic Quarterly 53 (4‐5):381-395.

Analytics

Added to PP
2013-11-22

Downloads
6 (#1,430,516)

6 months
5 (#629,136)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Add more citations

References found in this work

No references found.

Add more references