In computability theory, a semicomputable function is a partial function that can be approximated either from above or from below by a computable function.
More precisely a partial function is upper semicomputable, meaning it can be approximated from above, if there exists a computable function , where is the desired parameter for and is the level of approximation, such that:
Completely analogous a partial function is lower semicomputable if and only if is upper semicomputable or equivalently if there exists a computable function such that:
If a partial function is both upper and lower semicomputable it is called computable.
See also
editReferences
edit- Ming Li and Paul Vitányi, An Introduction to Kolmogorov Complexity and Its Applications, pp 37–38, Springer, 1997.
🔥 Top keywords: Akademia e Shkencave e RPS te ShqiperiseAlexandria Ocasio-CortezBilderberg GroupCristiano RonaldoDong XiaowanMinecraftOperation GladioPrimal cutRiot FestStrictly Come Dancing (series 7)Main PageSpecial:SearchWikipedia:Featured picturesKalki 2898 ADUEFA Euro 2024Project 2025.xxxKarel deLeeuw2024 Copa AméricaA Quiet Place: Day OneCleopatraDeaths in 2024Jack Draper (tennis)House of the DragonNikki HiltzDiogo CostaJuiceroOpinion polling for the 2024 United Kingdom general electionUEFA European ChampionshipTheodore StreleskiCristiano RonaldoYouTubeKlay ThompsonCopa AméricaThe Bear (TV series)Elias YmerJoe Biden2024 French legislative electionMerih DemiralMoney in the Bank (2024)Zac EfronBad Boys: Ride or DieInside Out 2Gladiator IIArda GülerKevin OrtegaMemphis DepayMarko ArnautovićCody Gakpo