We should crowd source a database of things that people believe and arguments they use


  1. We need to back up our beliefs with good logic  Score: 9
  2. We can build a relational database that outlines our beliefs relatively cheaply 
  3. If we entered our beliefs and arguments into databases, there are many features of relational databases  that could help us come to better conclusions. 
  4. If we can sequence millions of lines of Human DNA, you would think that we could organize our thoughts and beliefs. 
  5. You need advanced scientific methods to sequence the human genome, but all you need is a database to outline the things people believe.
  6. If you use a relational database to associate arguments with the beliefs they support, you could design a scoring system  that analyze the validity people's arguments, and then the cumulative validity of their beliefs. 

A relational database is the best way of outlining our beliefs

Other good idea promoting algorithms: laws


I believe that tallying the number of laws that agree or disagree with a belief can serve as a measure of how strongly society deems something to be wrong.

For example, every society considers murder to be wrong and typically addresses it through some form of criminal justice system.

To quantify this, we can assign scores to conclusions based on the number of laws supporting a belief (e.g., murder is wrong) and the quality of arguments linking a law to that belief. Factors to consider could include the relationship score between the belief and the law, the severity of punishment for violating the law, and the relative number of laws that agree or disagree with the belief or any of its supporting arguments. This can be achieved by creating an equation and implementing it in software.

A comprehensive algorithm could be designed to account for all these factors in the following manner:

Law Score = Sum of scores for (Laws that agree - Laws that disagree) * Linkage Strength between law and the belief (the score of the arguments that the law is truly established on the belief) * Punishment Sevarity


We can represent the relationship between laws and beliefs more concisely using algebra and the following definitions:

Definitions:

  • LAn/LDn: Laws that are argued to agree (LAn) or disagree (LDn) with a conclusion.
  • LAn+LDn: Total number of laws submitted in this forum as reasons to agree or disagree with a conclusion. To normalize this factor and ensure it carries the appropriate weight, we could tweak multiplication factors or allow users to adjust them.
  • LSn: Linkage Score - The linkage would be treated as its own argument, with reasons to agree or disagree, and a score ranging from -1 to 1. A negative score indicates a law that contradicts the intended suggestion, 0 means the law has no relation, and 1 signifies that the law fully supports the intended conclusion.
  • Psn: Punishment Severity - This factor considers the classification of the offense (felony or misdemeanor) and the typical punishment duration (e.g., years of imprisonment).

By applying these definitions, we can create a comprehensive algorithm that takes into account various factors to determine the strength of the relationship between laws and beliefs.



Examples: Should the burqa be required or banned?

For instance, the fact that nearly all countries outlaw "murder of innocent adults" indicates the level of validity that most societies attribute to this belief. In some cases, laws might disagree and agree on controversial topics. For example, there are countries that both ban and require women to wear burqas. To measure society's opinion on whether it is wrong to wear a burqa, one could compare the number of countries that ban them (e.g., France) and the number of countries that require them (e.g., Afghanistan, Saudi Arabia). Depending on which side is being supported, the percentage of countries banning the burqa could be added or subtracted from the total number of countries with relevant laws.

Examples: Is shooting an intruder a justifiable action that protects law-abiding citizens, or is it an immoral act that ends a life prematurely?

In this case, one could consider the percentage of states that deem it wrong to shoot an intruder as evidence supporting the belief that it is morally wrong to do so.

Other good idea promoting algorithms: laws



I believe that we can count the number of laws that agree or disagree with a belief, as a way of measuring how much  society believes something is wrong.

For example every society believes that murder is wrong, and often punishes it with some sort of criminal justice program.

A way of quantifying this so that you can give scores to conclusions based on the quantity of laws that are said to support a belief (like murder is bad) and the quality of arguments that a law supports a certain belief about a behavior being bad, the relationship score between the belief and the law, the severity of punishment for breaking the law, and the relative number of laws that can be said to agree or disagree with the belief, or any of the supporting arguments, would be to make an equation and build it in software.

A way of counting all of this with a powerful algorithm could be expressed this way:


Or we could represent the math more simply by substituting algebra, with the following definitions:



Definitions:

·         LAn/LDn: Laws that are argued to agree or disagree or disagree with a conclusion
·         LAn+LDn::Number of laws submitted in this forum as reasons to agree or disagree with a conclusion. I’m just trying to find some way of normalizing this factor, or weigh it, so that it doesn’t carry too much or too little weight. Obviously, like any other factor on this forum, we could tweak multiplication factors, or allow users to tweak them.
·         LSn: Linkage Score: The linkage would become its own argument, with reasons to agree, and a score between -1 and 1. A negative score would be a law that actually makes a counter argument to the intended suggestion, 0 has no relation, and 1 fully supports the intended conclusion.
·         Psn: Punishment severity. For instance is the punishment a felony or a misdemeanor. How many years of prison are people typically punished.  


Examples: Is the Burqa so important that it should be required, or so bad it should be banned?

For example, the fact that almost all countries outlaw “murder of innocent adults” represents the amount of validity that most societies attribute to a belief. It may be rare that you would have laws that disagree and agree on non controversial topics. However, there are countries that ban and require women to wear Burqas. A way of measuring if mankind thinks it is wrong to wear the burqa would be to take the number of countries that ban them (France, etc) and subtract the number of countries that require them (Afghanistan, Saudia Arabia, etc).  Depending on what side of this is used to support, you would subtract or add the percentage of countries that ban it compared to the total number of countries that have laws on the use of an item.

Examples: Is shooting an intruder a good activity that helps protect law followers, or is it a bad activity that ends a life too soon
You could add the percentage of states that say it is wrong to shoot an intruder, as evidence to support the belief that is wrong to do this.

Scoring Beliefs and Conclusions: An Algorithmic Approach for an Online Forum

This online forum employs a relational database to catalog reasons supporting or opposing various conclusions. It allows users to submit a belief as evidence to back another belief (Refer to Figure #1). According to Equation #1, a conclusion receives a score derived from the scores of its underpinning assumptions. Similarly, assumption scores are calculated based on their corresponding assumptions, until we reach verifiable data.

Basic Algorithm:

Conclusion Score (CS) is a weighted sum of different types of scores, each calculated as the difference between supporting and opposing elements for the given conclusion. It is represented as:

Conclusion Score (CS) = ∑ [(LS * RS_agree - LS * RS_disagree) * RIW]
+ ∑ [(LS * ES_agree - LS * ES_disagree) * EIW]
+ ∑ [(LS * IS_agree - LS * IS_disagree) * IIW]
+ ∑ [(LS * BS_agree - LS * BS_disagree) * BIW]
+ ∑ [(LS * IMS_agree - LS * IMS_disagree) * IMIW]
+ ∑ [(LS * MS_agree - LS * MS_disagree) * MIW]


Where:

  • CS: Conclusion Score
  • LS is the Linkage Score, representing the strength of the connection between an argument and the conclusion it supports.
  • n represents the number of steps an argument is removed from an idea. For instance, a direct reason to agree or disagree is one step removed, whereas a reason to agree with a reason to agree is two steps removed.
  • RS, ES, IS, BS, IMS, and MS are scores associated with reasons, evidence, investments, books, images, and movies respectively that support or counter the belief. Each score is associated with a weighting factor (RIW, EIW, IIW, BIW, IMIW, and MIW) to signify its importance.

In this equation, each element (reason, evidence, investment, etc.) is first multiplied by its respective Linkage Score (LS) to represent the strength of the association with the conclusion, and then it contributes to the overall conclusion score (CS) in proportion to its importance weight (RIW, EIW, IIW, etc.). The score for each type is calculated as the difference between the scores for supporting and opposing elements.

Assistance Needed!
I'm seeking feedback on the clarity and feasibility of this concept. If there are any areas of confusion, or if the mathematical notation could be improved, I'd greatly appreciate suggestions.

Assumptions:
For instance, consider the belief that the leaders of Nazi Germany were evil. This belief is bolstered by many arguments, yet it can also serve as an argument itself, supporting other conclusions such as the idea that it was justifiable for the US to join WWII.

· Numerator: The numerator is obtained by subtracting the count of unique reasons to disagree from the count of unique reasons to agree. Consequently, if the "valid" reasons to agree are fewer, the numerator will be negative.

· Denominator: The denominator comprises the total count of reasons, both for and against. This computation normalizes the equation, rendering the conclusion score (CS) as the overall percentage of agreeable reasons. Therefore, the conclusion score will fluctuate between -100% and 100% (or -1 and +1).

· Definitions:
- A: Represents unique arguments that agree with a conclusion.
- D: Represents unique arguments that disagree with a conclusion.
- L: Stands for Linkage Score, a number between zero and 1. This metric quantifies the strength with which an argument is purported to support a conclusion.

· Unique Arguments: Every belief would have a template that enables the proposal of a statement that articulates the same idea more effectively. This statement would become a new argument with its unique conclusion score. For instance, if the rephrased belief gets a similarity rating of 98%, then it would contribute just 2% of its score to the new conclusion.

· For n = 1: Arguments like A(1,1) and A(1,2) are the first and second reasons to agree, respectively. Each contributes one point to the conclusion score, with the contribution moderated by the L (linkage score) multiplier.

· For n = 2: Arguments such as A(2,1) and A(2,2) are the first and second reasons to agree, where n equals 2. These could either be reasons agreeing with a reason to agree or reasons disagreeing with a reason to disagree. Each of these contributes half a point to the conclusion score due to the equation's design. Modifying the equation could change these contributions to a quarter point each to the conclusion score. This contribution is crucial since weakening an assumption logically weakens all conclusions built upon it. This value of n could be iteratively updated for reasonable results or uniquely determined by each platform. Note that D(n,j) represents reasons to disagree, and they function similarly. Here, j instead of i is used to indicate their independence. As such, second-order reasons to disagree could include reasons disagreeing with reasons to agree or reasons agreeing with reasons to disagree.

· L = Linkage Score: Let's consider the conclusion, "It was good for us to join WWII." An argument submitted could be, "Nazis were doing bad things," to support the conclusion. If this belief already has a high score of, say, 99%, it could be granted a linkage score of 90% towards supporting the conclusion. As a result, it would contribute 0.495 points (0.99 X 0.5) to the conclusion score for the belief, "It was good for us to join WWII". Another belief submitted could be, "Nazis were committing wide-scale systematic genocide," supporting the conclusion. Given that not all countries that "do bad things" justify a war, this linkage score could potentially be higher, perhaps 98%.


Investment-Based Scoring:

M = Money invested in a belief
TM = Total Money invested in the forum
#B = Number of beliefs

The average amount of money invested in an idea is computed as TM / #B. The aim of this metric is to assign 1 point for an idea with an average investment, and 2 points for a belief with double the average investment.

This concept is predicated on the idea of users being able to purchase “stock” in a belief based on its idea score, with the expectation that the idea score would rise. Transaction fees would be set high enough to prevent financial losses and ensure that only those with sound judgment profit from this mechanism. Additionally, stocks would only be sold for ideas that are relatively stable.


Certified Logic Instructors

  • NP: Represents the number of times a certified** logic instructor has validated or invalidated the logic of a reason to disagree. By summing "ns", we can account for instances where a logic professor disagrees with a specific belief.
In our context, a "certified" logic instructor is defined as someone possessing a ".edu" email address associated with the philosophy department of an accredited university. This stipulation helps ensure that the individuals evaluating the logic of arguments have a credible academic background in the field of philosophy.

Book References

  • B: Denotes books that support or oppose the given conclusion.
  • BS: Book Score - takes into account factors like the number of books sold, as well as reviews and ratings of the books.
  • BLS: Book Link Score - It's possible to have a well-regarded book that doesn't necessarily support the proposed belief. Each argument suggesting that a book supports a belief becomes its own claim with its own book "linkage score" that is calculated according to the above formula.

Voting System

  • UV/DV: Upvotes or Downvotes.
  • #U: Number of Users.
    We'll use an overall upvote or downvote system, in addition to votes on specific attributes like logic, clarity, originality, verifiability, and accuracy, among others.

Additional Evidence Sources

Movies, songs, expert opinions, and other sources of evidence can also support or oppose different conclusions, similarly to books. For example, movies - often documentaries - could be evaluated based on scores from sites like Rotten Tomatoes. This data could be imported, along with formal logical arguments that a movie attempts to support or oppose a belief.

**Certification for logic instructors is assumed to be from a reputable institution or organization. The exact criteria for certification can be defined based on the requirements of the forum.

Link Score (L)

When users submit beliefs as reasons to support other beliefs, they may occasionally attempt to forge a link where one doesn't truly exist. For instance, someone might submit the belief "The grass is green" as a reason to support the conclusion "The NY Giants will win the Super Bowl". Although the belief that "the grass is green" might receive a high score for its general acceptance, the "Link Score" in this context would be near zero due to its irrelevance to the conclusion.

  • As we refine this system, we might have to apply multiplication factors to some elements to ensure that they do not carry too much or too little weight in the overall scoring.

Enriching Mathematical Learning Through the Practical Application of Algorithms

Dear Esteemed Mathematics Educators,

I am reaching out to you today with an exciting proposition - a unique opportunity to engage your students in the application of mathematical principles in an unconventional and meaningful way. It involves a novel algorithm designed to evaluate and promote ideas based on the strength of the reasoning and evidence provided.

Here is the formula we're discussing:

Conclusion Score (CS) = ∑ [(LS * RS_agree - LS * RS_disagree) * RIW]
+ ∑ [(LS * ES_agree - LS * ES_disagree) * EIW]
+ ∑ [(LS * IS_agree - LS * IS_disagree) * IIW]
+ ∑ [(LS * BS_agree - LS * BS_disagree) * BIW]
+ ∑ [(LS * IMS_agree - LS * IMS_disagree) * IMIW]
+ ∑ [(LS * MS_agree - LS * MS_disagree) * MIW]

More detailed information about these variables can be found on our websites: https://github.com/myklob/ideastockexchange and https://www.groupintel.org/.

In an era where discourse is increasingly digitized, this algorithm operates within a web-based forum. It allows users to submit reasons to agree or disagree with a belief, and encourages further discussion by allowing additional reasoning to be submitted for these primary arguments. The algorithm integrates these layers of discourse, forming an assessment of the belief's validity by counting and comparing reasons to agree and reasons to disagree.

Why introduce this into your mathematics curriculum?

  1. Innovation: This algorithm provides a unique application of mathematical principles in an area traditionally untouched by such methods - the evaluation and promotion of ideas.

  2. Engagement: By combining mathematics with discourse, debate, and real-world application, students can experience the practical and impactful side of their mathematical studies.

  3. Idealism: This project aligns well with the idealistic nature of young minds. It enables students to contribute positively to global conversations, fostering a deeper connection to their learning.

  4. Potential Impact: Just as Google's PageRank algorithm revolutionized the internet by ranking web pages based on their inbound links, our algorithm seeks to enhance discourse by assessing and promoting good ideas. This creates an informed and critical thinking internet community.

  5. Towards a Smarter World: The development and use of such algorithms can contribute to a more informed, critical and intelligent world.

I encourage you to review this proposal and consider the immense potential it holds for enriching your curriculum and inspiring your students. I am eager to answer any questions or provide further information at your convenience.

Thank you for your time and consideration.

Best regards,
Mike

An open letter to Math teachers

I am writing you to ask for your assistance in promoting "good idea promoting algorithms" such as the following:

The above formula would work in an environment were you were able to submit reasons to agree or disagree with a belief, and then you could submit reasons to agree or disagree with those arguments. With this format it place you could count the reasons to agree and subtract the number of reasons to disagree, and then you could integrate the series of reasons to agree with reasons to agree.

You should use this equation because:
  1. It is unique. I have never seen someone use an algorithm in an attempt to promote good ideas. Math can become more interesting when kids see the variety of ways it can be applied. 
  2. Kids are idealistic, and often want to improve the world. Challenging them to try to come up with a good idea promoting algorithm can use this energy, to learn math.
  3. This simple that counts the reasons to agree with a conclusion, could change the wold, similar to how Google's web-link counting algorithm changed the world. When lots of people link to a website, Google assumes that website is a good one. Then when that good website links to another website, Google assumes the 2nd website is a good one. Similarly when you submit good reasons to support an argument, a smart web forum would also give points to the conclusions that are built on that assumption. 
  4. The more people make good idea promoting algorithms, the less stupid world we will live in.

Optimal Algorithm for Online Forums Utilizing Relational Databases for Debate

In an online forum that utilizes a relational database to track arguments either supporting or countering conclusions, and allows users to submit their beliefs as reasons to support other beliefs, the deployment of the following algorithm can prove highly advantageous:




Or with math:



The equation for the idea score can be represented as:

Basic Algorithm:

Conclusion Score (CS) is a weighted sum of different types of scores, each calculated as the difference between supporting and opposing elements for the given conclusion. It is represented as:

Conclusion Score (CS) = ∑ [(LS * RS_agree - LS * RS_disagree) * RIW]
+ ∑ [(LS * ES_agree - LS * ES_disagree) * EIW]
+ ∑ [(LS * IS_agree - LS * IS_disagree) * IIW]
+ ∑ [(LS * BS_agree - LS * BS_disagree) * BIW]
+ ∑ [(LS * IMS_agree - LS * IMS_disagree) * IMIW]
+ ∑ [(LS * MS_agree - LS * MS_disagree) * MIW]


Where:

  • CS: Conclusion Score
  • LS is the Linkage Score, representing the strength of the connection between an argument and the conclusion it supports.
  • n represents the number of steps an argument is removed from an idea. For instance, a direct reason to agree or disagree is one step removed, whereas a reason to agree with a reason to agree is two steps removed.
  • RS, ES, IS, BS, IMS, and MS are scores associated with reasons, evidence, investments, books, images, and movies respectively that support or counter the belief. Each score is associated with a weighting factor (RIW, EIW, IIW, BIW, IMIW, and MIW) to signify its importance.

The idea score is calculated by subtracting the sum of the argument scores multiplied by their respective linkage scores for the reasons to disagree from the sum of the argument scores multiplied by their respective linkage scores for the reasons to agree. This equation takes into account the relative strength and linkage of each argument in determining the overall idea score.


The equation for the linkage score can be represented as:

The linkage score is calculated by subtracting the sum of the sub argument scores that disagree from the sum of the sub argument scores that agree, and then dividing it by the total number of arguments. This value is then multiplied by 100% to express the result as a percentage. The linkage score represents the percentage of weighted scores that agree with the belief, indicating the strength of the agreement among the sub arguments in relation to the total number of arguments.

Unique Score (US) = [(Sum of scores agreeing that two statements are unique) - (Sum of scores disagreeing that two statements are unique)] / (Total argument scores) * 100

This score evaluates the uniqueness of two statements, normalizing it by the total argument scores. The score ranges from -100 to +100, where -100 indicates full agreement that two statements are not unique (or identical), and +100 indicates full agreement that two statements are indeed unique.