• Welcome to Religious Forums, a friendly forum to discuss all religions in a friendly surrounding.

    Your voice is missing! You will need to register to get access to the following site features:
    • Reply to discussions and create your own threads.
    • Our modern chat room. No add-ons or extensions required, just login and start chatting!
    • Access to private conversations with other members.

    We hope to see you as a part of our community soon!

questfortruth

Well-Known Member
The P versus NP problem is a major unsolved problem in computer science. It asks whether every problem whose solution can be quickly verified can also be solved quickly.

It has to be P=NP in not an atheistic-nihilistic-secular but rather the Orthodox understanding of Christianity. Driver knows better about driving than non-driver, Surely, Christians know better about Christianity, than non-Christians.

A computational algorithm in Orthodox Christianity is the action plan:
1. formulate task or problem,
2. ask the Orthodox Christian God,
3. get the answer.

About the author: Dmitri Martila, 20.Jan.2022,
first published in ResearchGate.
 
Last edited:

shunyadragon

shunyadragon
Premium Member
The P versus NP problem is a major unsolved problem in computer science. It asks whether every problem whose solution can be quickly verified can also be solved quickly.

It has to be P=NP in not an atheistic-nihilistic-secular but rather the Orthodox understanding of Christianity. Driver knows better about driving than non-driver, Surely, Christians know better about Christianity, than non-Christians.

A very subjective argument without a clear coherent answer. Very circular. What people subjectively believe about their own belief does not make it necessarily true.

Which 'Orthodox Christianity? since many people believe in what they call 'Orthodox Christianity, and disagree.
A computational algorithm in Orthodox Christianity is the action plan:
1. formulate task or problem,
2. ask the Orthodox Christian God,
3. get the answer.

Many millions ask the Christian God, and get may diverse conflicting responses.
 
Last edited:

shunyadragon

shunyadragon
Premium Member
I asked and got solutions to all most important problems of science and math. Published in
https://www.researchgate.net/profile/Dmitri-Martila

The site you referenced does not answer the questions involving many different diverse and conflicting answers people get from asking God.

Again . . . Which Orthodox Christianity are you referring to, science many Christians believe their Orthodox Christianity is the only true one, and they disagree and conflict with each other.
 

shunyadragon

shunyadragon
Premium Member
The P versus NP problem is a major unsolved problem in computer science. It asks whether every problem whose solution can be quickly verified can also be solved quickly.

It has to be P=NP in not an atheistic-nihilistic-secular but rather the Orthodox understanding of Christianity. Driver knows better about driving than non-driver, Surely, Christians know better about Christianity, than non-Christians.

A computational algorithm in Orthodox Christianity is the action plan:
1. formulate task or problem,
2. ask the Orthodox Christian God,
3. get the answer.

About the author: Dmitri Martila, 20.Jan.2022,
first published in ResearchGate.

First any computer problem solving process like P=NP(?) is simply a mechanical computer process and not remotely related to any philosophical/theological beliefs such as atheism nor any other subjective beliefs such as Orthodox Christianity.

To add: Problem solving in the mechanical belief neutral computer science is difference to problem solving in Methodological Naturalism in science. In science problem solving which is based on the proposal of theories and hypothesis based on objective verifiable evidence of our physical existence. Computer science like math is a tool of science in problem solving. This process of problem solving in science is not remotely related related to subjective religious beliefs.

The bottom line is Methodological Naturalism cannot falsify any hypothesis that proposes any question as to whether God(s) exist or not. There is no possible thing such as atheistic science,
 
Last edited:

TagliatelliMonster

Veteran Member
Surely, Christians know better about Christianity, than non-Christians.

Really? The vast majority of christians I meet in real life actually know surprisingly / disturbingly little about their religion.

Plenty of polls have also pointed out that your average western atheist actually also knows more about christianity then your average western christians.

A computational algorithm in Orthodox Christianity is the action plan:
1. formulate task or problem,
2. ask the Orthodox Christian God,
3. get the answer.

Ask your Orthodox Christian God what I had for lunch yesterday and get back to me when he answered.

1000 bucks says you'll get it wrong.
 

shunyadragon

shunyadragon
Premium Member
The P versus NP problem is a major unsolved problem in computer science. It asks whether every problem whose solution can be quickly verified can also be solved quickly.

It has to be P=NP in not an atheistic-nihilistic-secular but rather the Orthodox understanding of Christianity. Driver knows better about driving than non-driver, Surely, Christians know better about Christianity, than non-Christians.

A computational algorithm in Orthodox Christianity is the action plan:
1. formulate task or problem,
2. ask the Orthodox Christian God,
3. get the answer.

About the author: Dmitri Martila, 20.Jan.2022,
first published in ResearchGate.

Another thought. Please explain how P=NP is defined and used in computer science.
 

questfortruth

Well-Known Member
Problem solving in the mechanical belief neutral computer science
The definition of mechanical neutral PC solving: the way to get solution must be logical. But God is not a source of absurd. Hence, it has to be P=NP. And indeed, I have proven the most complicated Riemann Hypothesis in just one page! As well as the abc conjecture in one page. Hence, it has to be P=NP.
 

shunyadragon

shunyadragon
Premium Member
The definition of mechanical neutral PC solving: the way to get solution must be logical. But God is not a source of absurd. Hence, it has to be P=NP. And indeed, I have proven the most complicated Riemann Hypothesis in just one page! As well as the abc conjecture in one page. Hence, it has to be P=NP.

You have NOT proven the Riemann Hypothesis, and there is absolutely no relationship to the knowledge of science as you specifically described. Please present your proof and how it has any relevance to the evolving knowledge of science. As in the reference the Reimann Hypothesis is not subject to proof, but subject to conjecture and opinion. Even though ;likely true it have not been proven.

Riemann hypothesis - Wikipedia

In mathematics, the Riemann hypothesis is a conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part 1/2. Many consider it to be the most important unsolved problem in pure mathematics.[1] It is of great interest in number theory because it implies results about the distribution of prime numbers. It was proposed by Bernhard Riemann (1859), after whom it is named.

The Riemann hypothesis and some of its generalizations, along with Goldbach's conjecture and the twin prime conjecture, make up Hilbert's eighth problem in David Hilbert's list of 23 unsolved problems; it is also one of the Clay Mathematics Institute's Millennium Prize Problems, which offers a million dollars to anyone who solves them. The name is also used for some closely related analogues, such as the Riemann hypothesis for curves over finite fields.

The Riemann zeta function ζ(s) is a function whose argument s may be any complex number other than 1, and whose values are also complex. It has zeros at the negative even integers; that is, ζ(s) = 0 when s is one of −2, −4, −6, .... These are called its trivial zeros. The zeta function is also zero for other values of s, which are called nontrivial zeros. The Riemann hypothesis is concerned with the locations of these nontrivial zeros, and states that:

The real part of every nontrivial zero of the Riemann zeta function is 1/2.

Thus, if the hypothesis is correct, all the nontrivial zeros lie on the critical line consisting of the complex numbers 1/2 + i t, where t is a real number and i is the imaginary unit.

I believe in God and yes God is not the source of the absurd, but because of the fallible nature of humans the diverse conflicting and contradictory beliefs of humans concerning religion are nost often wrong and no relationship to the knowledge of science,

Mathematical papers about the Riemann hypothesis tend to be cautiously noncommittal about its truth. Of authors who express an opinion, most of them, such as Riemann (1859) and Bombieri (2000), imply that they expect (or at least hope) that it is true. The few authors who express serious doubt about it include Ivić (2008), who lists some reasons for skepticism, and Littlewood (1962), who flatly states that he believes it false, that there is no evidence for it and no imaginable reason it would be true. The consensus of the survey articles (Bombieri 2000, Conrey 2003, and Sarnak 2005) is that the evidence for it is strong but not overwhelming, so that while it is probably true there is reasonable doubt."

The computer concept of P=NP (?) nor the Reimann Hypothesis have any relationship to the knowledge of science based on Methodological Naturalism.

Again math and computers are tools of science and do not in and of themselves determine the knowledge of Methodological Naturalism. You have failed to justify your claim.

Please describe in detail the relationship you propose as applied to science. So far you have not provided a coherent argument.
 
Last edited:
Top