Algoritmicheskie Problemy Algebry, Bioinformatiki I Robototekhniki

Seriya knig s obshchim nazvaniem "Algoritmicheskie problemy algebry, bioinformatiki i robototekhniki" posvyashchena sistematicheskomu izlozheniyu algoritmicheskikh problem algebry, bioinformatiki i robototekhniki, v kotorom za osnovu vzyato nalichie obshchnosti kombinatornykh idey v trekh rassmatrivaemykh oblastyakh. Pri glubokom izuchenii algoritmicheskikh problem i metodov ikh resheniya estestvennym obrazom prikhodit ponimanie togo, chto nas okruzhayut stroki dannykh, kombinatornye skhemy. Ikh priroda dostatochno universal'na. Kniga "Ekvatsional'naya rekursivnost' i granitsy razreshimosti" yavlyaetsya pervoy v serii. Eto pervaya iz shesti knig, posvyashchennykh preimushchestvenno algebraicheskoy problematike. Poetomu v knige znachitel'noe vnimanie udelyaetsya bazovym ponyatiyam, kotorye imeyut vazhnoe znachenie ne tol'ko dlya rezul'tatov dannoy knigi, no i posleduyushchikh. V chastnosti, k etim ponyatiyam sleduet otnesti mashiny Minskogo i slova Murskogo. Kniga nachinaetsya so stat'i "Vvedenie v algoritmicheskie problemy algebry". Eta stat'ya daet obshchiy obzor naibolee vazhnykh postanovok algoritmicheskikh problem algebry. Ona pomogaet chitatelyu otsenit' mesto rezul'tatov, predstavlennykh v knige, v obshchey kartine issledovaniy po algoritmicheskim problemam algebry.