>Stephen Wolfram's 2-state 3-symbol Turing machine was proved to be universal.
I consider this a ternary computer.
>Does a 2-state 2-symbol one exist?
binary computers.
What's the smallest universal Turing machine that does halt?
Small in what sense?
from wiki about radix economy regarding 3 states:
"Since 2 / ln(2) ≈ 2.89 and 3 / ln(3) ≈ 2.73, it follows that 3 is the integer base with the lowest average radix economy."
did that help you?
Let me define a new complexity class [math]\mathcal{CM}(f)[/math] which is the class of all languages which can be decided by a Conscious Mind in time [math]f(n)[/math]. As usual, we denote [math]CMP = \bigcup_{k}\mathcal{CM}(n^k)[/math].
It should be obvious that [math]\mathcal{P}\subset \mathcal{CMP}[/math].
My claim now is that there is no non-conscious complexity class properly containing [math]\mathcal{CMP}[/math]. In particular [math]\mathcal{CMP} \not\subset \mathcal{EXPSPACE} [/math]. In words: There are properties of conscious minds which will never be simulated by conventional Turing machines.
Of course you're free to criticize my suggestion.
Do you have any reasons for believing so? Also, what does conscious mean?
What WM and font?
pls post config
do you really think someone's going to buy your shit? fuck off
A bit. I didn't know about the term radix economy, although it makes sense that it's a studied topic. I remember reading a blogpost a long time ago that proved that e had the best economy.
i3, Fira Mono, github.com
Cool, I thought that was i3.
I already use it so I'll just steal your config.
Complexity theory is pretty cool so I'll come back and actually try to contribute to this thread by doing the beginner problem in a bit
How do I beat this?
Is there a list of the maximums somewhere?
Wew, I did it.
I'm trying three but it's pretty hard.
I don't really have a method other than trial and error.