computability

Is it possible to create an algorithm which generates an autogram?

牧云@^-^@ 提交于 2020-02-03 18:58:35
问题 An autogram is a sentence which describes the characters it contains, usually enumerating each letter of the alphabet, but possibly also the punctuation it contains. Here is the example given in the wiki page. This sentence employs two a’s, two c’s, two d’s, twenty-eight e’s, five f’s, three g’s, eight h’s, eleven i’s, three l’s, two m’s, thirteen n’s, nine o’s, two p’s, five r’s, twenty-five s’s, twenty-three t’s, six v’s, ten w’s, two x’s, five y’s, and one z. Coming up with one is hard,

Why can Conway’s Game of Life be classified as a universal machine?

痴心易碎 提交于 2019-12-18 09:59:30
问题 I was recently reading about artificial life and came across the statement, "Conway’s Game of Life demonstrates enough complexity to be classified as a universal machine." I only had a rough understanding of what a universal machine is, and Wikipedia only brought me as close to understanding as Wikipedia ever does. I wonder if anyone could shed some light on this very sexy statement? Conway's Game of Life seems, to me, to be a lovely distraction with some tremendous implications: I can't make

What's a Turing machine?

被刻印的时光 ゝ 提交于 2019-12-18 09:59:20
问题 What is a Turing machine and why do people keep mentioning it? My IBM PC is all I need to do my computation! Why does anyone care about these machines? 回答1: The reason that Turing Machines are a big deal has to do with the study of classical Computing Science or Theory of Computation type stuff. It's basically about analyzing the general properties of a computer, such as what theoretical abilities and limitations a computer has, as well as what we mean when we talk about "computing" something

Can rebol parse function be able to create rules for parsing css2 / css3 fully?

若如初见. 提交于 2019-12-12 19:02:53
问题 Are there limitation to rebol parse function power ? Would it be capable of parsing the whole css2 / css 3 spec or will it encounter theorical impossibility to form some rules ? Update after HostileFork answer: I mean in regexp I think it would be rather impossible, is parse much more powerfull ? If yes does it mean it would be possible to build a browser in rebol vid compatible with html5 ? 回答1: Your question of "are there limits" is slippery. I'll try and give you " the answer" instead of

Can a Turing machine perform Quicksort?

寵の児 提交于 2019-12-10 10:08:31
问题 As far as I know, a Turing machine can be made to execute loops or iterations of instructions encoded on a Tape. This can be done by identifying Line separators and making the Turing machine go back until a specific count of Line separators is reached (that is, inside the loop). But, can a Turing machine also execute a recursive program? Can someone describe various details for such a Turing Machine? I suppose, if recursion can be executed by a Turing machine, the Quicksort can also be

Can a Turing machine perform Quicksort?

…衆ロ難τιáo~ 提交于 2019-12-06 01:48:56
As far as I know, a Turing machine can be made to execute loops or iterations of instructions encoded on a Tape. This can be done by identifying Line separators and making the Turing machine go back until a specific count of Line separators is reached (that is, inside the loop). But, can a Turing machine also execute a recursive program? Can someone describe various details for such a Turing Machine? I suppose, if recursion can be executed by a Turing machine, the Quicksort can also be performed? If the question is if a Turing Machine can execute a sorting algorithm, the answer is yes, since

What's a Turing machine?

蓝咒 提交于 2019-11-29 19:40:44
What is a Turing machine and why do people keep mentioning it? My IBM PC is all I need to do my computation! Why does anyone care about these machines? The reason that Turing Machines are a big deal has to do with the study of classical Computing Science or Theory of Computation type stuff. It's basically about analyzing the general properties of a computer, such as what theoretical abilities and limitations a computer has, as well as what we mean when we talk about "computing" something. One example of something that one might study using Turing Machines is The Halting Problem . While this

Why can Conway’s Game of Life be classified as a universal machine?

青春壹個敷衍的年華 提交于 2019-11-29 19:05:17
I was recently reading about artificial life and came across the statement, "Conway’s Game of Life demonstrates enough complexity to be classified as a universal machine." I only had a rough understanding of what a universal machine is, and Wikipedia only brought me as close to understanding as Wikipedia ever does. I wonder if anyone could shed some light on this very sexy statement? Conway's Game of Life seems, to me, to be a lovely distraction with some tremendous implications: I can't make the leap between that and calculator? Is that even the leap that I should be making? You can build a