Path: csiph.com!eternal-september.org!feeder.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: Ben Bacarisse Newsgroups: comp.programming Subject: Re: [OT] Re: Rubik Cube Date: Thu, 08 Dec 2016 02:56:15 +0000 Organization: A noiseless patient Spider Lines: 15 Message-ID: <87inqvcenk.fsf@bsb.me.uk> References: <87ede84c-c196-4e44-956f-7e1729be4963@googlegroups.com> <20161207172958.735@kylheku.com> Mime-Version: 1.0 Content-Type: text/plain Injection-Info: mx02.eternal-september.org; posting-host="dcbcf2bbf9d49280f8863de003463fff"; logging-data="6605"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19ZuSDUPKqE0TPwIbp702B5izgk6s66vA4=" Cancel-Lock: sha1:XcTRIATtfQW9taloJA8Le7OTCmY= sha1:AubHLyNxCpcpwbnDGPODqi18r9M= X-BSB-Auth: 1.702d8465499cfec711db.20161208025615GMT.87inqvcenk.fsf@bsb.me.uk Xref: csiph.com comp.programming:7087 "Mr. Man-wai Chang" writes: > Could one use a single, unified mathematics equation to describe this > algorithm? Yes. There is a theorem in computability theory (the MRDP theorem) that equates Turing machines and Diophantine equations. But this is a formal equivalence between computing something and solving a specific kind of equation and may not be what you were asking about. (BTW, interleaved and bottom posting is usually preferred to top posting.) -- Ben.