Skip to main content
Bjørn Kjos-Hanssen's user avatar
Bjørn Kjos-Hanssen's user avatar
Bjørn Kjos-Hanssen's user avatar
Bjørn Kjos-Hanssen
  • Member for 14 years, 9 months
  • Last seen this week
revised
Loading…
awarded
accepted
Loading…
revised
Is the nearest walk to Brownian motion uniform?
deleted 138 characters in body
Loading…
Loading…
asked
Loading…
comment
Markov chain convergence problem.
@Gerald Edgar: You're right. I fixed my answer in response to your comment.
revised
Markov chain convergence problem.
fixed answer in response to Gerald Edgar's comment
Loading…
comment
Convergence of a markov matrix
Since the question asks about limits of matrices and not about almost sure behavior, I guess Borel-Cantelli is not relevant.
answered
Loading…
revised
Convergence of a markov matrix
added 49 characters in body
Loading…
revised
Convergence of a markov matrix
deleted 296 characters in body
Loading…
answered
Loading…
awarded
comment
Models for the given FOL statement
Well then consider the sentence $\forall x(P(x)\vee\neg P(x))$. This has a model of size 2 but no model of size 3 in your sense. Because of the three elements, two have to agree about whether they satisfy $P$ and so there is nothing left to distinguish them.
revised
Models for the given FOL statement
added 189 characters in body
Loading…
answered
Loading…
comment
What is the probability a random Turing machine is isomorphic to a DFA?
@Joel: I suppose we are not looking at finite observation data, but rather observing what has transpired at time $\omega$ (infinity). @Robin: It should be non-zero because there is at least one DFA.
comment
What is the probability a random Turing machine is isomorphic to a DFA?
@Jacques: one could say that the size of a number in (0,1) is inessential, whereas asymptotic properties of the sequence of binary digits in the number are essential. Chaitin's Omega can also be anywhere in (0,1), but it is always a Martin-Löf random number.