In response to comment by on P: 0 <= P <= 1
Comment author: 29 August 2017 10:16:41AM 0 points [-]

As is written, g(var) picks out one arbitrary subset of the infinite set. There are 2^Aleph_null possible subsets g(var) can produce, thus, g(var) can (not does) produce uncountably infinite many true propositions.

In response to comment by on P: 0 <= P <= 1
Comment author: 29 August 2017 04:48:45PM 0 points [-]

Ok, I see what you're trying to do now (though the pseudocode you wrote still doesn't do it successfully). It's true that with randomness, there are uncountably many infinite strings that could be produced. But you still have no way of referring to each one individually, so there's little point in calling them "propositions", which typically refers to claims that can actually be stated.

In response to comment by on P: 0 <= P <= 1
Comment author: 29 August 2017 12:52:21AM 0 points [-]

Grant the program an infinite amount of time. I didn't say the program must terminate did I.

In response to comment by on P: 0 <= P <= 1
Comment author: 29 August 2017 04:42:02AM 1 point [-]

A program can't pick out arbitrary subsets of an infinite set either. Programs can't do uncountably many things, even if you give them an infinite amount of time to work with.

In response to comment by on P: 0 <= P <= 1
Comment author: 29 August 2017 12:04:41AM 0 points [-]

Must I write them down? I wrote a program that could write them down.

In response to comment by on P: 0 <= P <= 1
Comment author: 29 August 2017 12:07:48AM 0 points [-]

No, you didn't. A program can't write down an infinite amount of information either.

In response to comment by on P: 0 <= P <= 1
Comment author: 28 August 2017 11:07:23PM 0 points [-]

Why can't you take the conjunction of infinitely many propositions?

In response to comment by on P: 0 <= P <= 1
Comment author: 29 August 2017 12:01:34AM 1 point [-]

You can't write it down in any finite amount of time.

In response to comment by on P: 0 <= P <= 1
Comment author: 28 August 2017 05:59:37PM 0 points [-]

I showed a method for constructing uncountably many propositions using recursion.

In response to comment by on P: 0 <= P <= 1
Comment author: 28 August 2017 07:29:32PM 0 points [-]

It appears that you're starting with some countably infinite set S of propositions, and then trying to make a proposition for each subset of S by taking the conjunction of all propositions in the subset. But all but countably many of those subsets are infinite, and you can't take the conjunction of infinitely many propositions.

In response to comment by on P: 0 <= P <= 1
Comment author: 28 August 2017 07:35:57AM *  0 points [-]

Do you agree that there are (uncountably) infinite many propositions to which we can assign a probability of 1. Then we assign a probability of 0 to the negation of those propositions.

In response to comment by on P: 0 <= P <= 1
Comment author: 28 August 2017 05:21:50PM 1 point [-]

No, of course not. As I said, there are only countably many propositions you can express at all.

In response to P: 0 <= P <= 1
Comment author: 28 August 2017 02:18:28AM 1 point [-]

There can't be uncountably many propositions to which you assign probability 0, because you can only express countably many propositions.

Regarding your Pascal's mugging argument, VNM-rational agents don't assign infinite or negative infinite utility to anything. The variant using utility that is vast but finite in magnitude need not convince an agent that assigns the extreme outcome comparably tiny but nonzero probability. And it doesn't work for agents with bounded utility functions, because they don't assign such high utilities to any outcome, and thus there aren't any outcomes that they must assign extremely tiny probabilities to in order to avoid weird behavior.

Comment author: 20 July 2017 12:14:20AM 0 points [-]

Can anyone point me to any good arguments for, or at least redeeming qualities of, Integrated Information Theory?

Comment author: 28 June 2017 07:58:38PM 0 points [-]

So you might have two sentences A and B shown as two circles, then "A and B" is their intersection, "A or B" is their union, etc. But "A implies B" doesn't mean one circle lies inside the other, as you might think! Instead it's a shape too, consisting of all points that lie inside B or outside A (or both).

There's nothing intuitionistic about this. You can do exactly the same thing with classical logic, if you just forget about the topological "other details" that you alluded to.

Comment author: 21 June 2017 04:04:10AM *  0 points [-]

Decision theory (which includes the study of risks of that sort) has long been a core component of AI-alignment research.

Comment author: 21 June 2017 09:24:08PM 0 points [-]

Decision theory (which includes the study of risks of that sort)

No, it doesn't. Decision theory deals with abstract utility functions. It can talk about outcomes A, B, and C where A is preferred to B and B is preferred to C, but doesn't care whether A represents the status quo, B represents death, and C represents extreme suffering, or whether A represents gaining lots of wealth and status, B represents the status quo, and C represents death, so long as the ratios of utility differences are the same in each case. Decision theory has nothing to do with the study of s-risks.

View more: Next