[GreenKeys] [External] Re: Need example punched in ITA2 code

[Eric Moore]

.tap is baudot ITA-2 (or should be, double check it) and message is the ascii.

git clone https://gitlab.com/NF6X_Retrocomputing/papertape.git

python3 tapeutil.py --load ./doug_message.txt --ascii2tty --render_pbm
5 doug_tape_out.tap --save doug_message.tap

-Eric

On Mon, Mar 30, 2026 at 2:26 PM Eric Moore <mooreericnyc at gmail.com> wrote:
>
> This should be the 5 level baudot tape - my image reader was not happy
> loading it, but the preview looked good.
>
> I will send the .tap and .txt files seperately since this is 17MB
>
> On Mon, Mar 30, 2026 at 2:15 PM Harold Hallikainen <harold at w6iwi.org> wrote:
> >
> >
> >
> > On Mon, March 30, 2026 12:05 pm, Eric Moore wrote:
> > > I am home soon, will produce an image of the tape using
> > > https://gitlab.com/NF6X_Retrocomputing/papertape
> >
> >
> > NICE!
> >
> >
> > --
> > https://w6iwi.org
-------------- next part --------------
ON COMPUTABLE NUMBERS, WITH AN APPLICATION TO
THE ENTSCHEIDUNGSPROBLEM

BY A. M. TURING

[RECEIVED 28 MAY, 1936. -- READ 12 NOVEMBER, 1936)

   THE ''COMPUTABLE'' NUMBERS MAY BE DESCRIBED BRIEFLY AS THE REAL
NUMBERS WHOSE EXPRESSIONS AS A DECIMAL ARE CALCULABLE BY FINITE MEANS.
ALTHOUGH THE SUBJECT OF THIS PAPER IS OSTENSIBLY THE COMPUTABLE NUMBERS,
IT IS ALMOST EQUALLY EASY TO DEFINE AND INVESTIGATE COMPUTABLE FUNCTIONS
OF AN INTEGRAL VARIABLE OR A REAL OR COMPUTABLE VARIABLE, COMPUTABLE
PREDICATES, AND SO FORTH.  THE FUNDAMENTAL PROBLEMS INVOLVED ARE,
HOWEVER, THE SAME IN EACH CASE, AND I HAVE CHOSEN THE COMPUTABLE NUMBERS
FOR EXPLICIT TREATMENT AS INVOLVING THE LEAST CUMBROUS TECHNIQUE.  I HOPE
SHORTLY TO GIVE AN ACCOUNT OF THE RELATIONS OF THE COMPUTABLE NUMBERS,
FUNCTIONS, AND SO FORTH TO ONE ANOTHER.  THIS WILL INCLUDE THE DEVELOPMENT
OF THE THEORY OF FUNCTIONS OF A REAL VARIABLE EXPRESSED IN TERMS OF COM-
PUTABLE NUMBERS.  ACCORDING TO MY DEFINITION, A NUMBER IS COMPUTABLE
IF ITS DECIMAL CAN BE WRITTEN DOWN BY A MACHINE.
   IN @@9, 10, I GIVE SOME ARGUMENTS WITH THE INTENTION OF SHOWING THAT THE
COMPUTABLE NUMBERS INCLUDE ALL NUMBERS WHICH COULD NATURALLY BE
REGARDED AS COMPUTABLE.  IN PARTICULAR, I SHOW THAT CERTAIN LARGE CLASSES
OF NUMBERS ARE COMPUTABLE.  THEY INCLUDE, FOR INSTANCE, THE REAL PARTS OF
ALL ALGEBRAIC NUMBERS, THE REAL PARTS OF THE ZEROS OF THE BESSEL FUNCTIONS,
THE NUMBERS PI, E, ETC.  THE COMPUTABLE NUMBERS DO NOT, HOWEVER, INCLUDE
ALL DEFINABLE NUMBERS, AND AN EXAMPLE IS GIVEN OF A DEFINABLE NUMBER
WHICH IS NOT COMPUTABLE.
   ALTHOUGH THE CLASS OF COMPUTABLE NUMBERS IS SO GREAT, AND IN MANY
WAYS SIMILAR TO THE CLASS OF REAL NUMBERS, IT IS NEVERTHELESS ENUMERABLE.
In @8 I EXAMINE CERTAIN ARGUMENTS WHICH WOULD SEEM TO PROVE THE CONTRARY.
BY THE CORRECT APPLICATION OF ONE OF THESE ARGUMENTS, CONCLUSIONS ARE
REACHED WHICH ARE SUPERFICIALLY SIMILAR TO THOSE OF GODEL.  THE RESULTS
-------------- next part --------------
A non-text attachment was scrubbed...
Name: doug_message.tap
Type: application/octet-stream
Size: 2025 bytes
Desc: not available
URL: <http://mailman.qth.net/pipermail/greenkeys/attachments/20260330/02964058/attachment.obj>