[Q]: Tranform from TM to TagSystem without changing binary to unary?
From: Andre (sky4walk_at_gmx.de)
Date: 12/16/03
- Next message: Aatu Koskensilta: "Re: Help with undecidable problem"
- Previous message: Sterten: "Re: Finding the Maximum Number of Node-disjoint Cycles"
- Next in thread: Paul Chapman: "Re: Tranform from TM to TagSystem without changing binary to unary?"
- Reply: Paul Chapman: "Re: Tranform from TM to TagSystem without changing binary to unary?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: 16 Dec 2003 05:13:28 -0800
Hi,
I read Choke and Minskys document tranforming a Turing machine to a
Tag System.
ftp://publications.ai.mit.edu/ai-publications/0-499/AIM-052.ps
But this depends on changing binary Turing String to an unary string
which also change time complexity to 2^n. I tried to find another
solution not changing this but I cannot find one. Does there a
solution exist or is it impossible to simulate a Turing Machine on a
Tag System?
Thank you
André Betz
- Next message: Aatu Koskensilta: "Re: Help with undecidable problem"
- Previous message: Sterten: "Re: Finding the Maximum Number of Node-disjoint Cycles"
- Next in thread: Paul Chapman: "Re: Tranform from TM to TagSystem without changing binary to unary?"
- Reply: Paul Chapman: "Re: Tranform from TM to TagSystem without changing binary to unary?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]