1
Just Chat! / Re: Where do I get my confidence to challenge established theories?
« on: Today at 04:18:00 »Like sleeping or going to a vacation.People need some break from routine activities.Such as kneeling before a parasite every 7 days?
Show Posts
This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.
2
New Theories / Re: Universal Utopia? What's The Universal Terminal Goal?
« on: Yesterday at 16:29:15 »Only conscious entities can have a goal or objective. Until then, the improvement in survival can be considered as merely side effects.In the perspective of the survivors, being better at survival is preferred. Their perspective is what matters.Time doesn't flow backwards. Neither does evolution. The test of survival cannot precede the evolution of the object being tested. So evolution cannot have an objective.
The effects of evolutionary process in an environment can be seen more clearly by contrasting with conditions without evolutionary process. The latter will be extremely less likely to cause improvements in survival.
3
New Theories / Re: Where does quantization of energy of electromagnetic radiation come from?
« on: Yesterday at 16:01:05 »
The unit of Planck's constant suggests that the parameter being quantized is the ratio between energy and frequency. E/f = n.h
Electromagnetic radiation is related to the motion of electric charge, with electrons as the smallest unit. It's only natural to think that the faster an electron is moving, which is corresponding to higher frequency, the higher its radiated energy.
Electromagnetic radiation is related to the motion of electric charge, with electrons as the smallest unit. It's only natural to think that the faster an electron is moving, which is corresponding to higher frequency, the higher its radiated energy.
4
New Theories / Re: Where does quantization of energy of electromagnetic radiation come from?
« on: Yesterday at 14:24:40 »As I have said many times. Wherever did you get the idea that it might be?You are the one who said that.
5
New Theories / Re: How close are we from building a virtual universe?
« on: Yesterday at 07:47:41 »
NVIDIA?s New AI: Huge Game Changer!
The paper "CLoSD - Closing the Loop between Simulation and
Diffusion for multi-task character control" is available here:
https://guytevet.github.io/CLoSD-page/
📝 My paper on simulations that look almost like reality is available for free here:
https://rdcu.be/cWPfD
The paper "CLoSD - Closing the Loop between Simulation and
Diffusion for multi-task character control" is available here:
https://guytevet.github.io/CLoSD-page/
📝 My paper on simulations that look almost like reality is available for free here:
https://rdcu.be/cWPfD
6
New Theories / Re: Universal Utopia? What's The Universal Terminal Goal?
« on: Yesterday at 03:32:08 »
Artificial Super Intelligence (ASI) is imminent - Cognitive Hyper Abundance is coming
7
New Theories / Re: Universal Utopia? What's The Universal Terminal Goal?
« on: Yesterday at 03:31:09 »Objective is preferred. Outcome is not always preferred.Wrong. There is no objective in evolution.There is. It's to be better at survival.
An outcome is not an objective.
Sometimes evolutionary process produces suboptimal outcomes, or even something that's worse than before.
In the perspective of the survivors, being better at survival is preferred. Their perspective is what matters.
8
New Theories / Re: What makes NP problems hard to solve?
« on: 18/01/2025 15:43:48 »
Here's a modified version of the search problem above, but now from the iterative process side. Guess a number between 0 and n. But you are not allowed to ask if it's higher or lower than a specified number. You are only allowed to ask if they are equal.
In the worst case, it would take n guesses to get the right answer.
Alternatively, you are told if the difference is less than 10. Or 100.
In the worst case, it would take n guesses to get the right answer.
Alternatively, you are told if the difference is less than 10. Or 100.
9
New Theories / Re: What makes NP problems hard to solve?
« on: 18/01/2025 15:34:06 »
Here's a modified version of the search problem above, from the search space side. Guess a number between 0 and 2^n. Again, the verification process is easy. But the solution would take log(2^n) = n steps.
It would be even longer to guess a number between 0 and n^n.
It would be even longer to guess a number between 0 and n^n.
10
New Theories / Re: What makes NP problems hard to solve?
« on: 18/01/2025 12:45:09 »
Basically, complexity of a problem depends on the size of its search space, and the size of impact and cost of each step or iteration in solving it.
Let's start with a simple problem, like binary search for guessing the number game. The verification process is very simple. Just compare the answer to the hidden number.
In this case the search space is n=1000, which is equal to the explicit problem statement. The impact of each step can remove false answers by half.
If the search space is increased to 1 million, it would take longer to solve. In general, if the search space is n, the number of steps needed to solve it is around log(n).
Let's start with a simple problem, like binary search for guessing the number game. The verification process is very simple. Just compare the answer to the hidden number.
In this case the search space is n=1000, which is equal to the explicit problem statement. The impact of each step can remove false answers by half.
If the search space is increased to 1 million, it would take longer to solve. In general, if the search space is n, the number of steps needed to solve it is around log(n).
11
New Theories / Re: what is temperature?
« on: 18/01/2025 11:57:20 »Good heavens! Whatever will those crazy scientists discover next? Are air, water and glass transparent? Can x-rays pass through the human body?You seem to forget that water and typical glasses are not transparent in infrared spectrum.
12
New Theories / Re: what is temperature?
« on: 18/01/2025 11:41:43 »
Most of us know that impedance is frequency dependent. Mathematical model for impedance is a complex number. Thermodynamics and black body radiation seem to consider only the real part of this impedance. That's because in those cases, the imaginary part is not significant. They're only special cases from the more general cases where the radiating or radiated bodies are not necessarily black body.
It's understandable that scientific research started with simpler cases. But let's not forget that there are more than what earlier discovery has told us.
It's understandable that scientific research started with simpler cases. But let's not forget that there are more than what earlier discovery has told us.
13
New Theories / Re: what is temperature?
« on: 17/01/2025 22:14:58 »Impedance matching in mechanical wave.
14
New Theories / Re: what is temperature?
« on: 17/01/2025 21:12:32 »These videos show that energy transfer by radiation can be passed through material as well as being absorbed. Other experiments show that it ca also be reflected. This is like impedance matching problem in electronic engineering.
15
Just Chat! / Re: Is there a universal moral standard?
« on: 17/01/2025 12:38:43 »And the last three are not.They are in USA and Spain.
The message is that coal power plants are becoming obsolete, following the fates of coal powered trains and ships.
16
New Theories / Re: What makes NP problems hard to solve?
« on: 17/01/2025 10:04:04 »
A working definition of NP-hard (Stephen Boyd, Stanford)
Prof. Stephen Boyd, of the Dept. of Electrical Engineering at Stanford, briefly explains what NP-hard means.
This clip was taken from the Prof. Boyd's class "EE364a Convex Optimization 1" and can be found at:
http://www.stanford.edu/class/ee364a/
Prof. Stephen Boyd, of the Dept. of Electrical Engineering at Stanford, briefly explains what NP-hard means.
This clip was taken from the Prof. Boyd's class "EE364a Convex Optimization 1" and can be found at:
http://www.stanford.edu/class/ee364a/
17
New Theories / Re: What makes NP problems hard to solve?
« on: 17/01/2025 09:57:55 »
The Formal Definition of P (P vs NP)
Let?s take a deeper look at the complexity class P, and decision problems.
Let?s take a deeper look at the complexity class P, and decision problems.
18
New Theories / Re: What makes NP problems hard to solve?
« on: 17/01/2025 09:48:32 »
Does P=NP? | Richard Karp and Lex Fridman
Richard Karp is a professor at Berkeley and one of the most important figures in the history of theoretical computer science. In 1985, he received the Turing Award for his research in the theory of algorithms, including the development of the Edmonds?Karp algorithm for solving the maximum flow problem on networks, Hopcroft?Karp algorithm for finding maximum cardinality matchings in bipartite graphs, and his landmark paper in complexity theory called "Reducibility Among Combinatorial Problems", in which he proved 21 problems to be NP-complete. This paper was probably the most important catalyst in the explosion of interest in the study of NP-completeness and the P vs NP problem.
Richard Karp is a professor at Berkeley and one of the most important figures in the history of theoretical computer science. In 1985, he received the Turing Award for his research in the theory of algorithms, including the development of the Edmonds?Karp algorithm for solving the maximum flow problem on networks, Hopcroft?Karp algorithm for finding maximum cardinality matchings in bipartite graphs, and his landmark paper in complexity theory called "Reducibility Among Combinatorial Problems", in which he proved 21 problems to be NP-complete. This paper was probably the most important catalyst in the explosion of interest in the study of NP-completeness and the P vs NP problem.
19
New Theories / Re: What makes NP problems hard to solve?
« on: 16/01/2025 21:54:27 »
What will the P=NP proof look like? | Cal Newport and Lex Fridman
20
New Theories / Re: What makes NP problems hard to solve?
« on: 16/01/2025 15:19:41 »It depends on how you define well informed.IMO, the biggest factor in determining P vs NP problem is because the problem isn't well structured/defined.And is your opinion well informed?