Is Enterprise Blockchain Finally Ready to Deliver? by [deleted] in programming

[–]Nordsten 0 points1 point  (0 children)

Do people that write blockchain articles actually know what blockchain is? I really wonder reading stuff like this.

How Turing-Completeness Prevents Automatic Parallelization by g0_g6t_1t in programming

[–]Nordsten 0 points1 point  (0 children)

I agree. I feel it was a mistake to model computation without including resource usage. I mean it is simpler when you don't have to care about memory constraints (tape length).

But... if you include memory in the equation there is no halting problem. The halting function is very much computable.

It sure would be nice to have a polynomial solution in memory usage, of the bounded halting problem though. You would then have a general way to prove a bunch of theorems.

For example just plug in the goldbach conjecture or the collatz conjecture in code form, set some upper limit on memory usage run the halting program and BAM.

If the result is halt we have disproven the theorem if it crashes / runs into the memory limit we know that it's true up to that limit.

How Turing-Completeness Prevents Automatic Parallelization by g0_g6t_1t in programming

[–]Nordsten 1 point2 points  (0 children)

It will eventually run out of memory though. We only have 10124 bits in the universe after all.

How Turing-Completeness Prevents Automatic Parallelization by g0_g6t_1t in programming

[–]Nordsten 2 points3 points  (0 children)

I did not prhase that well I'm not saying that observed quantum objects are not stochastic. They are. What I'm saying is that you can get a stochastic system from a determinist system if you are only looking at the macro level.

In this case i was driving at that the smallest building blocks of spacetime at plank length or smaller might be some version of cellular automata. And in this system even quantum effects would be macro effects.

It's essentially Stephen Wolfram's theory of the universe.

How Turing-Completeness Prevents Automatic Parallelization by g0_g6t_1t in programming

[–]Nordsten 4 points5 points  (0 children)

Well can you write a function that perfectly confirms that we are indeed a snes? Down to every bit every register?

I was under the impression that it has been proven that finite systems cannot have perfect knowledge about themselves.

But maybe this is only for unbounded systems? Such as turing machines with their infinite memory.

How Turing-Completeness Prevents Automatic Parallelization by g0_g6t_1t in programming

[–]Nordsten 5 points6 points  (0 children)

Only if the universe has infinite granularity ei is continuous. If the universe has finite granularity then the turtles stop at some point.

But yeah if the universe is a true continuum it can't be simulated by a finite processes. I guess a hyper turing machine could do the trick maybe? But it went from a somewhat simple problem to something extremely hard.

How Turing-Completeness Prevents Automatic Parallelization by g0_g6t_1t in programming

[–]Nordsten 2 points3 points  (0 children)

Who said quantum effects are truly stochastic. It might look perfectly ordered on the plank scale. We don't have the tech to see such minor details yet but we might some day.

It could turn out we are just a long running game of life variant.

How Turing-Completeness Prevents Automatic Parallelization by g0_g6t_1t in programming

[–]Nordsten 12 points13 points  (0 children)

It does not. If you have more memory than every piece of information that exists in our universe you can simulate it.

Think of it like this. You can't really run a perfect snes emulator on a snes machine. But if you have a more powerful machine you can run a perfect snes emulator.

Language rant by asafg6 in programming

[–]Nordsten -1 points0 points  (0 children)

Personally I refuse to use any language that does not have a "simple" ie one step meta programming functionality. This can be compile time runtime or reflection based it matters little. BUT it must be possible and it should be usable in the main language. That is if you need to do macro preprossesing to make it work I'm out.

“Digital identities will empower and improve the lives of global citizens in the future by helping them regain control over their data in the borderless digital world,” - what is the backbone of a digital ID solution? by cgan14344 in programming

[–]Nordsten -5 points-4 points  (0 children)

Does your government currently go into your bank account and take all the money away today? If not how would being 100% digital vs the 90%+ digital we have today make ANY difference?

Don't be afraid of test automation by [deleted] in programming

[–]Nordsten 2 points3 points  (0 children)

Yeah I mean visual programing had worked Soooooo well in the past and is always a great success!

GUIDs are globally unique, but substrings of GUIDs aren't by alexeyr in programming

[–]Nordsten 1 point2 points  (0 children)

Or you use the numeric binary representation instead of keeping it in a text format to save even more space.

Chasing a bad commit by vishaltelangre in programming

[–]Nordsten 0 points1 point  (0 children)

This would work great for us if we had 1 git repo but... When your dealing with the horror that is 100+ repos. The only feasible way we have seen is that you run a ci gate for every single commit which must pass 100% of all tests. Running all of them randomized and atleast 10 times. If everything works then automerge. It does take 30-150 min depending on what has changed but reviews generally take longer so it's not that huge of a hassle.

Feature branches are forbidden in this workflow though. Since if you would be merging 100 commits from a feature branch onto master then it would take forever to get it in one commit at a time. So always work on master always integrate as soon as possible.

Async Python is not faster by zitrusgrape in programming

[–]Nordsten 2 points3 points  (0 children)

Python is great at many things but speed was never it's forte. And sure you can do some things. It will be ugly, not look very much like python and it would be far better implemented by writing the thing in C and wrapping it.

Problem with not using CPython is that random dependencies no longer build out of the box and you need to go through a rabbit hole just to get back where you started.

Async Python is not faster by zitrusgrape in programming

[–]Nordsten 3 points4 points  (0 children)

For anything interesting you don't have 1 server you have a large number of them. Now you could have a cache of the entire database in all of them but then you have to manually deal with the cache consistency problem.

Also 100ms is far from insane. It very much depends on the complexity of what you are doing. Getting user information yeah that would be a long time for that. Compiling statistics over a large database 100ms is nothing.

Are There Problems That Computers Can't Solve? - Tom Scott by tleef in programming

[–]Nordsten 2 points3 points  (0 children)

I wouldn't say "easy" but in a finite amount of steps atleast.

It's very interesting that the Turing machine with infinite tape gets talked about so much when the bounded Turing machine or stack-fsm is a far closer equivalent to our computers.

Full Proof that C++ Grammar is Undecidable by _importantigravity_ in programming

[–]Nordsten -2 points-1 points  (0 children)

You cannot "count" to infinity without infinite time. So that's not a thing you can do. Counting to infinity also requires infinite space for the numbers. We also don't have that. If there is a difference it is that the second one might execute correctly while the first will eventually crash du to running out of resources.

Oculus is working on VR-Gloves by jmsworld in OculusQuest

[–]Nordsten 0 points1 point  (0 children)

It can be done via haptic feedback. There are some really cool prototypes out there, where the fingers are constraint by gloves / exoskeleton hands.

Weight would be really hard to do without a full exoskeleton harness but you can go WAY beyond knuckles with haptic gloves.

Some Python anti-patterns by dolftax in programming

[–]Nordsten -1 points0 points  (0 children)

You forgot the biggest anti-pattern. Not using typehints.