Most widely used special functions, such as orthogonal polynomials, Bessel functions, Airy functions, etc., are defined as solutions to differential equations with polynomial coefficients. This class of functions is referred to as D‐finite functions. There are many symbolic algorithms (and implementations thereof) to operate with these objects exactly. Recently, we have extended this notion to a more general class that also allows for good symbolic handling: differentially definable functions. In this paper, we give an overview on what is currently known about this new class.