A Turing machine

User avatar
ChrisGreaves
PlutoniumLounger
Posts: 15627
Joined: 24 Jan 2010, 23:23
Location: brings.slot.perky

A Turing machine

Post by ChrisGreaves »

There's nothing heavier than an empty water bottle

User avatar
HansV
Administrator
Posts: 78493
Joined: 16 Jan 2010, 00:14
Status: Microsoft MVP
Location: Wageningen, The Netherlands

Re: A Turing machine

Post by HansV »

I remember reading about Turing machines when I was a student.

There is something a bit perverse about using advanced technology including a microprocessor and LEDs to "create" a Turing machine, but of course it makes it possible to demonstrate much more of its capabilities than the extremely limited examples we could work out as students, with strips of paper, a pencil and an eraser.
Best wishes,
Hans

User avatar
ChrisGreaves
PlutoniumLounger
Posts: 15627
Joined: 24 Jan 2010, 23:23
Location: brings.slot.perky

Re: A Turing machine

Post by ChrisGreaves »

HansV wrote:There is something a bit perverse ...
Nice one Hans!
I developed a single-instruction computer on the Uni W.A. CYBER-72 many years ago. It was a thrill to bring the Cyber to its knees.
There's nothing heavier than an empty water bottle

User avatar
John Gray
PlatinumLounger
Posts: 5408
Joined: 24 Jan 2010, 08:33
Location: A cathedral city in England

Re: A Turing machine

Post by John Gray »

ChrisGreaves wrote:I developed a single-instruction computer on the Uni W.A. CYBER-72 many years ago. It was a thrill to bring the Cyber to its knees.
This single instruction was either STOP or B * (i.e. branch to the current instruction...)?
John Gray

"(or one of the team)" - how your appointment letter indicates you won't be seeing the Consultant...

User avatar
ChrisGreaves
PlutoniumLounger
Posts: 15627
Joined: 24 Jan 2010, 23:23
Location: brings.slot.perky

Re: A Turing machine

Post by ChrisGreaves »

John Gray wrote:This single instruction was either STOP or B * (i.e. branch to the current instruction...)?
Nice try, but no.
"Subtract And Store".
The program instruction cycle (crudely put) is:-

Code: Select all

Next:
       AC <-  (AC) - (Mem)
       Mem <- (AC)
       -> Next
I have some notes on it somewhere and will edit this post if/when I find them in the next hour or so.
(later)
Try this SUBS
I have some (Poole & Waite) STAGE2 macros for a talk I gave on the SUBS machine at a local NaSPA meeting 4 years ago.
There's nothing heavier than an empty water bottle

User avatar
StuartR
Administrator
Posts: 12609
Joined: 16 Jan 2010, 15:49
Location: London, Europe

Re: A Turing machine

Post by StuartR »

What a delightful project, I really enjoyed reading that site.
StuartR