Recent content by olgerm

in non-reativistic physics between all spacetime events both time difference and spacial-distance must be same in all frames of reference. Since both spacial-distance and time-difference between any 2 events can have arbitrary real-number values then spacetime-distance (aka interval) between any...

1 of famous examples where predictions of Newtonian-gravity and GR differ is perihelion precession of Mercury. Would predictions from GEM-model agree more with predictions of Newtonian-gravity or predictions of GR? GEM surely would predict Lense–Thirring precession. But would the overall...

Newtonian gravity and GEM can not be mixed that way because Newtonian gravity is Galilei-invariant, but GEM is lorenz-invariant. 1 interesting thing about GEM is that GM field itself has energy density (##J_{G0}=E_{G0}^2/2+B_{G12}^2/2+B_{G13}^2/2+E_{B23}^2/2##). Would it not cause some positive...

We can also write down gravitomagnetic equations using gravitomagnetic-4-potential. EM equations: ##dA_{E0}/dx0+dA_E1/dx1+dA_E2/dx2+dA_E3/dx3=0## (lorentz gauge condition) ##-dA_{E0}^2/dx0^2+dA_{E0}^2/dx1^2+dA_{E0}^2/dx2^2+dA_{E0}^2/dx3^2+J_{E0}=0##...

It is interesting to note, that these equations do not predict gravitational time dilation nor gravity bending light. But modifying these equations a little bit would give a model, that also predicts time dilation and gravity bending light. I wonder how many possible models of physics there are...

I add measurement uncertinity to my post 13. with probability 68% the units are in following range: ##4.790 482*10^{-43}*s >t_b>4.790 589*10^{-43}*s## ##1.4361 502*10^{-34}*m >l_b>1.4361 825*10^{-34}*m## ##1.5389 542*10^{-8 }*kg>m_b>1.5389 888*10^{-8}*kg## ##1.326211322 086*10^{-18}*C...

All tensors here are contravariant. from maxwell equation in terms of E-field we know that: $$\rho=\frac{\partial E_1}{\partial x_1}+\frac{\partial E_2}{\partial x_2}+\frac{\partial E_3}{\partial x_3}$$ from maxwell equation in terms of magnetic 4-potential in lorenz gauge we know that...

Since this is a correct implementation of F3, all other correct implementations of F3 must be logically equivalent to this one. All correct implementations of F3 must be also logically equivalent to implementations of F3 that use functions that can be "simplified out" from there. All correct...

Pay attention to that: in call of F3 H1 is never called so that both arguments of H1 are equal.

By not halting i mean that an algorithm would stay in an infinit loop. if an algorithm is implemented as a computerprogram and exectuted then the execution-process would never end itself. If a non-halting algrothm is implemented as python-subprogram(these are also called functions sometimes, but...

F3 is indeed equalent to the code you posted. the sourcecode to define F3 using H1 is correct. You could implement F3 this way using H1. Maybe it is my problem, but I do not see how does not prove that if H1 does not exist then F3 also does not exist. could you explain it going even to details...

function is something that maps any arguemnt to some value. not returning anything is not an option. as i said in my first post in this thread: We call G aa function that ccepts 1 argument and returns negation of what call of its argument with itself as its argument would return. aka ##G(x)=\neg...

it does not exist. If you think it does exist try to answer following questions: What you think G(G) should return? Is that what you think G(G) should return in accordance with definition of G? A diffenernt funciont (lets call it G2) that that has following properties: accepts 1 argument(lets...

## (A \implies B) \land (B \implies \neg A) ## is itself is not contradictory. it is same as just ##\neg A## . Possible values for A and B for this case: A=False and B=False A =False and B =True and it is untrue because ##B = \left ( D(D2) \text{ returns} \right ) ## not that ##B = \left (...

What is the issue? I do not see how this proves that F3 can not exist. *F3(D,D2)==True *form definition of F3 we know that if F3(D,D2)==True then D(D2) returns (in other words halts) *from definition of D we know that if D(D2) to ever returns then F3(D2,D2)==False *from definition of f3 we know...