Re: limitation to the halting proof

From: |-|erc (gotcha_at_beauty.com)
Date: 05/29/04 

Date: Sat, 29 May 2004 10:02:04 GMT

"The Ghost In The Machine" <ewill@aurigae.athghost7038suus.net>
> > can *write* hence *see*. you use a faulty premise of open
> > diagonalisation and when its shown to be nonsense you shift
> > the burden.
>
> I've yet to see a working proof that it's nonsense. Granted, every

you have. a consistent enumeration of all functions is entirely possible. [T / F]
now its not enough diag. is invalid, the proof that enumeration is impossible
you all flaunt is gone, so you change your stance to "ok I want to see
the actual list of numbers". it like proving the Earth is round, but no you
want to see the rewards of trade before you send off a boat.

> > you have no mathematical opposition to countable functions and
> > countable reals is just a step further. UTM(n), from n e N IS
> > the countable reals, it doesn't miss a beat, not all n halt thats
> > a petty copout requirement of YOUR argument, now even that is invalid.
>
> It's not even countable. It's finite.

N is infinite, its the only infinity. infinitely long lists of all variations of
computable functions (in some consistent dogma if you insist it completely halts aswell)
scribe the entire number line. the list is infinitely long its impossible to
miss a permutation, NO MATTER HOW LONG IT IS. even infinite
permutations, even the diagonal modified infinite permutation appears
within_the_infinite_list, enscribing that number onto the number line in
perfect precision. its difficult to *index* that number because of all
the cyclic tricks in its definition, but in the infinitely long list all digits of
the modified diagonal appear. ALL

> Of course mathematics does
> not always deal in the concrete and the graspable --

no there is no "of course" here, this is laymens language of yesteryears fairy numbers.

Herc

Relevant Pages

  • Re: Different size infinities?
    ... of a binary finite state machine augmented with an infinite memory ... for the purposes of diagonalisation, and these digits may update to ... Any supposed number not on the lists could ... I'll borrow the word permutation to mean unique sequence. ...
    (sci.math)
  • Re: Different size infinities?
    ... of a binary finite state machine augmented with an infinite memory ... for the purposes of diagonalisation, and these digits may update to ... Any supposed number not on the lists could ... I'll borrow the word permutation to mean unique sequence. ...
    (sci.logic)
  • Re: Different size infinities?
    ... of a binary finite state machine augmented with an infinite memory ... for the purposes of diagonalisation, and these digits may update to ... Any supposed number not on the lists could ... I'll borrow the word permutation to mean unique sequence. ...
    (comp.theory)
  • Re: Humble pie.
    ... >>infinite number of integers on it. ... > which, starting from the single unit, can not in principle be discovered by ... > repeat applications of a successor function ... list of natural numbers because lists are not in its domain. ...
    (sci.logic)
  • Cantor K.O.d -- again!
    ... demonstrating why "infinite" lists are logically impossible. ... the m_th symbol of the n_th list member is a circle with m dots ... the first list member has one symbol: a circle with one dot ...
    (sci.math)