Skip to main content

5 Result(s)

within Dimiter Skordev Remove this filter

and

  1. No Access

    Chapter

    Ivan Soskov: A Life in Computability

    On May 5, 2013, the Bulgarian logic community lost one of its prominent members—Ivan Nikolaev Soskov. In this paper we shall give a glimpse of his scientific achievements.

    Hristo Ganchev, Dimiter Skordev in The Incomputable (2017)

  2. No Access

    Chapter and Conference Paper

    On a Relative Computability Notion for Real Functions

    For any class of total functions in the set of natural numbers, we define what it means for a real function to be conditionally computable with respect to this class. This notion extends a notion of relative u...

    Dimiter Skordev, Ivan Georgiev in Models of Computation in Context (2011)

  3. No Access

    Chapter and Conference Paper

    A Subrecursive Refinement of the Fundamental Theorem of Algebra

    Let us call an approximator of a complex number α any sequence γ 0,γ 1,γ 2,... of rational complex numbers such that

    Peter Peshev, Dimiter Skordev in Logical Approaches to Computational Barriers (2006)

  4. No Access

    Chapter and Conference Paper

    Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions

    One usually defines the notion of a computable real number by using recursive functions. However, there is a simple way due to A. Mostowski to characterize the computable real numbers by using only primitive r...

    Dimiter Skordev in Computability and Complexity in Analysis (2001)

  5. No Access

    Chapter and Conference Paper

    On multi-valued homomorphisms

    Dimiter Skordev in Computation Theory (1985)