Jonathan Gorard

1.7K posts

Jonathan Gorard banner
Jonathan Gorard

Jonathan Gorard

@getjonwithit

Applied mathematician, computational physicist @Princeton Previously @Cambridge_Uni Making the universe computable.

Princeton, NJ Katılım Kasım 2012
18 Takip Edilen46.3K Takipçiler
Jonathan Gorard
Jonathan Gorard@getjonwithit·
@scheminglunatic If you read some of my previous papers (of which this project is an extension), you'll see that I've also been a big advocate of developing fully bespoke theorem-provers for domain-specific software verification, in large part due to frustrations with formalizing IEEE-754 in Roq
English
1
2
9
500
Jonathan Gorard
Jonathan Gorard@getjonwithit·
@scheminglunatic No, you're not. I much prefer the type systems of Roq/Isabelle for software verification. This particular project contains a mix of pure math and software verification, though, and my current plan is to use Lean for the former and some combination of Roq/Isabelle for the latter.
English
1
1
22
2.2K
Jonathan Gorard
Jonathan Gorard@getjonwithit·
The future is (auto)verified.
Jonathan Gorard tweet media
English
10
5
77
15.7K
Jonathan Gorard
Jonathan Gorard@getjonwithit·
@bhavaytyagi Of course. Random graphs are fully computable, break translation symmetry (so no Nielsen-Ninomiya), and admit general fermionic models with no doublers (with Dirac operator given by deformed incidence matrices). Lots of papers by Matsuura and Ohta about this. Just one example.
English
2
0
16
745
Bhavay Tyagi
Bhavay Tyagi@bhavaytyagi·
@getjonwithit Can you put isolated fermions on these data structures? In other words, simulate the weak sector?
English
1
0
0
859
pete wolfendale
pete wolfendale@deontologistics·
@dioscuri This isn’t helped by people conflating computers qua familiar von Neumann architecture artifacts and computation as rigorously defined by the Church-Turing confluence and the formalisms downstream from it, e.g., aeon.co/essays/your-br…
English
3
2
27
1.7K
Henry Shevlin
Henry Shevlin@dioscuri·
Not a fan of these clichéd “we used to think the mind was clockwork” analogies. Sometimes science just makes progress. Hearts really are pumps. DNA really is code-like. Disease really is caused by microorganisms. Some mechanistic explanations were wrong; others are just true.
Brooks Otterlake@i_zzzzzz

This is just like being alive in the 1600s when they got good at making complicated clocks and deduced that every complicated thing in the universe probably functioned exactly like a clock

English
88
151
1.7K
80.6K
Jonathan Gorard
Jonathan Gorard@getjonwithit·
@Barbi_bb The object’s acceleration depends only upon the mass of the Earth. But the Earth’s acceleration also depends only on the mass of the object. So it’s simply not true that they hit the bottom simultaneously - in one case the bottom is being accelerated upwards faster than the other
English
4
0
21
1.4K
M*s*c*l R*s*st*nc*
M*s*c*l R*s*st*nc*@Barbi_bb·
@getjonwithit In a vacuum tube, a heavy object and a much lighter object fall at same rate & hit the bottom simultaneously. Without air resistance, only force acting on the objects is gravity, which causes a constant acceleration of approximately \(9.8 \, m/s^2\) regardless of an object's mass
English
2
0
2
1.7K
Jonathan Gorard
Jonathan Gorard@getjonwithit·
The whole “objects of different masses fall at the same rate” thing is an approximation, assuming the Earth’s surface is fixed. But what we care about is the *relative* acceleration that combines both object and Earth accelerations, wherein we recover the Aristotelian prediction.
English
2
1
87
4.7K
Jonathan Gorard
Jonathan Gorard@getjonwithit·
@bzogrammer Fortunately, if RH is undecidable (plausible) then it's true. So it should still be resolvable one way or the other. (This is thanks to Matiyasevich's proof of equivalence of RH to a Diophantine inequality, and if a counterexample to the latter exists then it must be computable)
English
5
0
27
3.9K
Charles Rosenbauer
Charles Rosenbauer@bzogrammer·
"The Riemann Zeta Function describes how a whole family of infinite sums converge or diverge, except that there are layers upon layers of generalizations and extensions to fill domains that otherwise are hard to assign values to, including complex exponents." If you told me any one of these points, I'd already have my suspicions that this function might contain some undecidable properties. I actually would not be surprised at all if the Riemann Hypothesis is genuinely impossible to solve.
English
6
1
20
5.6K
Jonathan Gorard
Jonathan Gorard@getjonwithit·
Saint Francis of Assisi, I am in you.
Jonathan Gorard tweet media
English
6
2
49
5.4K
Peter
Peter@Phrases1439078·
The semantics don’t actually exist. A glider in a cellular automaton doesn’t actually exist, given mereological nihilism. The pattern is “true” but doesn’t exist. In contrast, my moment of conscious experience exists. When u see the red and blue squares at once 🟥🟦 their gestalts actually co-occur in an single unitary ontological unit that does exist, in contrast to the pixels on a screen or the bytes in a computer, which are only glued together at the functional level
English
1
0
4
427
Jonathan Gorard
Jonathan Gorard@getjonwithit·
Alright, replies indicate I need to explain this in more detail. Properly conceived, there is simply no difference between "simulated water" and "water". It's just water. But to understand that, one first needs to distinguish between two meanings of the word "computer". (1/11)
madison@dearmadisonblue

@getjonwithit They don't accept the idea that wetness, as a phenomenal quality, has anything to do with symbol processing. Wetness is not going to be grounded in purely mechanical properties. But if you have such a horrible feeling you could clarify a bit instead of this strange parenthetical.

English
38
19
274
66.6K
Jonathan Gorard
Jonathan Gorard@getjonwithit·
@dearmadisonblue No, semantics of computations (e.g. denotational semantics, operational semantics, axiomatic semantics) do not depend on anything to do with "minds of interpreters". I have read that paper, and "the abstraction fallacy" seems facile/nonsensical to me. Can you explain?
English
2
0
17
949
Jonathan Gorard
Jonathan Gorard@getjonwithit·
@dearmadisonblue I didn't say anything about anyone's head. I said that the role played by A's computational states in the emulation of B is identical to the role played by physical states in the emulation of A. What do you mean by "a good example of the abstraction fallacy"?
English
2
0
14
2.1K
madison
madison@dearmadisonblue·
@getjonwithit This is a good example of the abstraction fallacy. "Within computer A's semantics" means "inside my head, when I look at computer A". Computation doesn't spawn nested realities with relative notions of "physical"; this is a more mathematical version of playing with dolls
English
3
3
47
2.7K
Peniel
Peniel@Chancellorpen·
@getjonwithit But then, are we assuming minds are computers? On what basis?
English
1
0
3
2K
Jonathan Gorard
Jonathan Gorard@getjonwithit·
None of this argument depends upon physics/minds/water being Turing computable, by the way. If our universe permits hypercomputation, then I can construct nested hypercomputational simulations and apply exactly the same logic. There's nothing deep here - just confusion. (11/11)
English
15
1
84
5.5K
Jonathan Gorard
Jonathan Gorard@getjonwithit·
...as a property of the abstract state itself. It's identical to saying "The computational properties of Turing machines have nothing to do with electrons/wires". Of course they don't! The electrons/wires don't exist at that level, they exist (at least) one level higher. (10/11)
English
1
0
47
5.2K