A Mathematical Primer On Computability

The Book Provides A Self-contained Introduction Tonbsp;computability Theory For Advanced Undergraduatenbsp;or Early Graduate Students Of Mathematicsnbsp;and Computer Science. The Technical Materialnbsp;is Illustrated With Plenty Of Examples, Problemsnbsp;with Fully Worked Solutions As Well As A Range Ofnbsp;proposed Exercises.part I Is Centered Around Fundamentalnbsp;computability Notions And Results, Starting Withnbsp;the Pillar Concepts Of Computational Model (annbsp;abstract High-level Programming Language), Computable Function, Decidable And Listable Set, Proper Universal Function, Decision Problemnbsp;and The Reduction Technique For Transferringnbsp;decidability And Listability Properties. Thenbsp;essential Results Namely Ricersquo;s Theorem, Rice-shapirorsquo;s Theorem, Rice-shapiro-mcnaughton-myhillrsquo;s Theorem As Well As Rogersrsquo; Theoremnbsp;and The Recursion Theorem Are Presentednbsp;and Illustrated.