STD 10 CHAPTER 10 VARTUL ALL VIDEO FOR SSC STUDENT

STD 10 CHAPTER 10 VARTUL ALL VIDEO FOR SSC STUDENT

STD 10 CHAPTER 10 VARTUL ALL VIDEO FOR SSC STUDENT


STD 10 CHAPTER 9 TRIKON MITI NA UPYOGO  VIDEO LESSION
ALL VIDEO FOR SSC STUDENT
SSC MATHS VIDEO FOR STUDENT
SSC GANIT NA VIDEO STUDENT MATE
DHORAN 10 NA VIDYARTHIO MATE KHUB J UPYOGI VIDEO 
GHER BETHA SSC NA GANIT NA VIDEO JUO
VIDEO CHHANEL  NAME : maths by vataliya sir
VIDEO BANAVNAR NU NAME ; Ashvin

EKAM 9 TRIKON MITI NA UPYOGO VISHE VIDEO



Mathematical logic is concerned with setting mathematics within a rigorous axiomatic framework, and studying the implications of such a framework. As such, it is home to Gödel's incompleteness theorems which (informally) imply that any effective formal system that contains basic arithmetic, if sound (meaning that all theorems that can be proved are true), is necessarily incomplete (meaning that there are true theorems which cannot be proved in that system). Whatever finite collection of number-theoretical axioms is taken as a foundation, Gödel showed how to construct a formal statement that is a true number-theoretical fact, but which does not follow from those axioms. Therefore, no formal system is a complete axiomatization of full number theory. Modern logic is divided into recursion theory, model theory, and proof theory, and is closely linked to theoretical computer science,[citation needed] as well as to category theory. In the context of recursion theory, the impossibility of a full axiomatization of number theory can also be formally demonstrated as a consequence of the MRDP theorem.

Theoretical computer science includes computability theory, computational complexity theory, and information theory. Computability theory examines the limitations of various theoretical models of the computer, including the most well-known model – the Turing machine. Complexity theory is the study of tractability by computer; some problems, although theoretically solvable by computer, are so expensive in terms of time or space that solving them is likely to remain practically unfeasible, even with the rapid advancement of computer hardware. A famous problem is the "P = NP?" problem, one of the Millennium Prize Problems. Finally, information theory is concerned with the amount of data that can be stored on a given medium, and hence deals with concepts such as compression and entropy. Source wikipedia

STD 10 CHAPTER 9 TRIKON MITI NA UPYOGO  VIDEO LESSION
ALL VIDEO FOR SSC STUDENT
SSC MATHS VIDEO FOR STUDENT
SSC GANIT NA VIDEO STUDENT MATE
DHORAN 10 NA VIDYARTHIO MATE KHUB J UPYOGI VIDEO 
GHER BETHA SSC NA GANIT NA VIDEO JUO
VIDEO CHHANEL  NAME : maths by vataliya sir
VIDEO BANAVNAR NU NAME ; Ashvin sir vataliya

EKAM 9 TRIKON MITI NA UPYOGO VISHE VIDEO CLICK HERE TO WATCH

Post a Comment

Previous Post Next Post