opher ▁Z eno ▁of ▁Ele a . ▁Z eno ▁machines ▁play ▁a ▁cru cial ▁role ▁in ▁some ▁theories . ▁The ▁theory ▁of ▁the ▁Om ega ▁Point ▁de vised ▁by ▁phys ic ist ▁Frank ▁J . ▁Ti pler , ▁for ▁instance , ▁can ▁only ▁be ▁valid ▁if ▁Z eno ▁machines ▁are ▁possible . ▁ ▁Z eno ▁machines ▁and ▁comput ability ▁▁ ▁Z eno ▁machines ▁would ▁allow ▁some ▁functions ▁to ▁be ▁computed ▁that ▁are ▁not ▁T uring - comput able . ▁For ▁example , ▁the ▁hal ting ▁problem ▁for ▁T uring ▁machines ▁can ▁be ▁solved ▁by ▁a ▁Z eno ▁machine ▁( using ▁the ▁following ▁pseudo code ▁algorithm ): ▁▁ ▁begin ▁program ▁▁▁▁▁ ▁write ▁ 0 ▁on ▁the ▁first ▁position ▁of ▁the ▁output ▁t ape ; ▁▁▁▁▁ ▁begin ▁loop ▁▁▁▁▁▁▁▁▁ ▁simulate ▁ 1 ▁success ive ▁step ▁of ▁the ▁given ▁T uring ▁machine ▁on ▁the ▁given ▁input ; ▁▁▁▁▁▁▁▁▁ ▁if ▁the ▁T uring ▁machine ▁has ▁halt ed ▁then ▁▁▁▁▁▁▁▁▁▁▁▁▁ ▁write ▁ 1 ▁on ▁the ▁first ▁position ▁of ▁the ▁output ▁t ape ▁and ▁break ▁out ▁of ▁loop ; ▁▁▁▁▁ ▁end ▁loop ▁ ▁end ▁program ▁ ▁Comput ing ▁of ▁this ▁kind ▁that ▁goes ▁beyond ▁the ▁T uring ▁Lim it ▁is ▁called ▁hyper comput ation , ▁in ▁this ▁case ▁hyper comput ation ▁through ▁a ▁super task ▁– ▁see ▁there ▁for ▁further ▁discussion ▁and ▁literature . ▁ ▁See ▁also ▁▁ ▁Ross – L ittle wood ▁par ado x ▁ ▁Thom son ' s ▁lamp ▁ ▁Category : Models ▁of ▁computation ▁Category : T uring ▁machine ▁Category : Hy per comput ation