On 20 Aug 2011, at 04:24, meekerdb wrote:

On 8/19/2011 6:14 PM, Craig Weinberg wrote:> Perhaps later. See a bit below. Bp is meant for "the machinebelieves> p" when written in the language of the machine. If the machineis a> theorem prover for arithmetic, Bp is an abbreviation for> beweisbar('p') with beweisbar the arithmetical provabilitypredicate> of Gödel, and 'p' is for the Gödel number of p (that is adescription> of p in the language of the machine). The "#" is for anyproposition.Don't you need some temporality? B means "proves", but you use itan tenseless form also to mean "provable" and then also to mean"believes". But a machine being emulated by the UD doesn't "prove"everything provable at once. It works through them (and takes agreat many steps) and so it does "believe" everything that isprovable. Does that mean no thread of it's emulation is Loebianuntil induction has been proved/believed in that thread?

`At some level yes. Human "induction rule" (which makes them Löbian) is`

`probably hardwired by our biological history.`

Bruno http://iridia.ulb.ac.be/~marchal/ -- You received this message because you are subscribed to the Google Groups "Everything List" group. To post to this group, send email to everything-list@googlegroups.com. To unsubscribe from this group, send email to everything-list+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/everything-list?hl=en.