Quinn Culver

@Vrouvrou show that each is a subset of the other?

what up nerds

but i gotta run, you can check my website and research statement for details, if you want. bye

@BalarkaSen algorithmic randomness, which in my case is like probability theory with computability constraints/considerations

but i suppose 'pathological' is relative, @BalarkaSen

@BalarkaSen I think it's not pathological. Cantor space, the infinite binary branching tree, is essentially where all my research is done

@BalarkaSen I think you should try to prove it right now. Wanna?

is his blog/writing good?

you mean "Eliezer Yudkowsky", @morphic?

i just googled him

i don't think so

(i suppose)

good

ya, i think it is. but probably they suck. i've gleaned that these so-called 'rationalists' are just pseudo-intellectuals merely trying to provide arguments for voting for the democratic party, @morphic

what's a rationalist, @morphic?

life, poetry, bicycles, russian literature, cereal, french kissing, air jordans, freestyle rappiing, the pope, nihilism, et at. @morphic

@morphic

so you only wanna blog about math?

do you have one?

@morphic

no way man, blogs are so June 2015

i'm fine-ish, you?

does that mean you're on drugs, @morphic?

sup nerds

sounds like a nice talk, @MaryStar

elaborate, @MaryStar?

how did it go, @MaryStar?

@MaryStar

i.e. a violation of the Church-Turing thesis

you could ask them if one could diagonalize out of the Turing computable functions to get a function that is intuitively computable but not Turing computable

ya sure, @MaryStar

but right now i gotta go eat, @MaryStar, so I won't answer until later

ask away!

of course

yes that is similar in that they're both diagonalizations, @MaryStar

i'm talking about this one: en.wikipedia.org/wiki/Primitive_recursive_function#Limitations

which do you mean?

@MaryStar, there are many proofs that use the universalt TM.

ttyl

and i use gmail chat

you can email me, [email protected], if you want

i gotta go, @MaryStar

@MaryStar

what do you mean? There IS a universal Turing machine.

do you know the diagonalization way of constructing a computable function that isn't PR?

ok

(i mean, of course it seems easy to me since i've studied these things already)

@MaryStar

who's the audience?

seems too easy