uncomputability

>>8541251
Was there something you wanted to discuss, or are you just blogging?

>>8541251
Well you should know that a lot of those infinite "not computable" problems are pretty silly.

For example if you have problems A and B, and they are both uncomputable, you can have a different new problem C which ask you tou solve A and later B, and there you go, C is also uncomputable. Later you can do B&A, or A&A&B... and so on.

Infinite problems... well.

>>8541258
Just announcing my frustration to the world :D

but comments are welcome, of course

>>8541258
kek

>>8541263
I want to solve them all!

I think some God (the entity that started the universe simulation we are living) didn't wanted us to know if we are a simulation, so, we can't solve a lot a problems, probably if we could solve them we could determine if we are a simulation

>>8541263

The vast majority of irrational numbers are not computable, perhaps some of the universe constants (like G) are not computable

>>8541251

The interesting part is that there exist classes of algorithms which may compute some undecidable problems.

Consider the advice class P/poly: it can actually solve the unary halting problem!

>>8541274
I think you don't belong here.

>>8541300

I like that idea

>>8541307
where?

>>8541251
'Problems' here are languages, just a set of strings. Most are completley unintresting. Still is pretty cool though

>>8541300
P/1 can solve the unary halting problem because only one TM can be encoded with length n. Even theoretically that's kind of crap