Differences

This shows you the differences between two versions of the page.

--- tanszek:oktatas:techcomm:information_-_basics:description_of_information [2024/09/30 07:25] – knehez
+++ tanszek:oktatas:techcomm:information_-_basics:description_of_information [2024/09/30 17:43] (current) – knehez
@@ Line 13: / Line 13: @@
 The elements (which belong to a given set) can be defined by enumeration or by giving an exact principle of how they belong to that set.
-For example:
+**For example**:
 The set of natural numbers:
@@ Line 26: / Line 26: @@
 $$  A = \{x \mid x \text{ is an odd integer and } 1 \leq x < 10 \} $$
+or in modern C++:
+<sxh c++>
+std::set<int> mySet = {1, 2, 3};
+</sxh>
+or in Python:
+<sxh Python>
+my_set = {1, 2, 3}
+</sxh>
 The sets (and their belongings) are usually set in a sharp way.
@@ Line 35: / Line 46: @@
 In these cases the value of how an element is connected to a given set is defined by a '//membership function//'
 μm(x)
+{{:tanszek:oktatas:techcomm:information_-_basics:pasted:20240930-173642.png}}
 //Fuzzy sets// are a generalization of classical sets used in mathematics and logic to //handle uncertainty// and //partial membership//. Unlike classical sets where an element either belongs or does not belong to a set (membership is binary: 0 or 1), fuzzy sets allow for degrees of membership, represented by values between 0 and 1.
 Further reading: [[https://towardsdatascience.com/a-very-brief-introduction-to-fuzzy-logic-and-fuzzy-systems-d68d14b3a3b8|A very brief introduction to fuzzy-logic]]