
	Where results make sense

Topic: Turing tarpit

Related Topics

List of esoteric programming languages

Esoteric programming language

Turing machine

Iota and Jot programming languages

Brainfuck

Thue programming language

Befunge

Lazy K

UnLamda programming language

Perl

Church integer

Geertz

Greibach normal form

IBM RS64

Chomsky normal form

	turing machine - turing machine ace digital modern computer
		The concept of the Turing machine is based on the idea of a person executing a well-defined procedure by changing the contents of an unlimited number of ordered paper sheets that can contain one of a finite set of symbols.
		Turing machines shouldn't be confused with the Turing test, Turing's attempt to capture the notion of artificial intelligence.
		Turing tarpit, any computing system or language which, like the Turing machine, is not only Turing-complete but also useless for practical computing.
	www.infotechloco.com /Inf-Computer-Topics-Sy---Z/Turing-machine.html (2289 words)

	Turing tarpit
		A Turing tarpit is a programming language designed to be Turing-complete while minimizing the number of distinct instructions.
		Beware of the Turing tar-pit in which everything is possible but nothing of interest is easy." --Alan Perlis, "Epigrams on Programming".
		There are two sometimes divergent ways of viewing the challenge of designing a tarpit, those which lean towards fewer instructions, and those which lean towards fewer symbols recognised.
	www.ebroadcast.com.au /lookup/encyclopedia/tu/Turing_tarpit.html (111 words)

	Turing machine (Site not responding. Last check: 2007-10-13)
		The thesis that states that Turing machines indeed capture the informal notion of effective or mechanical method in logic and mathematics is known as the Church-Turing thesis.
		The concept of the Turing machine is based on the idea of a person executing a well-defined procedure by changing the contents of an infinite number of ordered paper sheets that can contain one of a finite set of symbols.
		For instance, the problem of determining whether a particular Turing machine will halt on a particular input, or on all inputs, known as the Halting problem, was shown to be undecidable in Turing's original paper.
	turing-machine.iqnaut.net (2239 words)

	turing_machine (Site not responding. Last check: 2007-10-13)
		Turing machines are extremely basic symbol-manipulating devices which â” despite their simplicity â” can be adapted to simulate the logic of any computer that could possibly be constructed.
		The concept of the Turing machine is based on the idea of a person executing a well-defined procedure by changing the contents of an unlimited paper tape, which is divided into squares that can contain one of a finite set of symbols.
		Turing tarpit, any computing system or language which, despite possessing Turing completeness, is generally considered useless for practical computing.
	www.treyparker.com /wiki/?title=Turing_machine (4112 words)

	Turing tarpit - Wikipedia, the free encyclopedia
		A Turing tar pit is a programming language designed to be Turing-complete while in some sense simplifying to the greatest extent possible both the syntax and the semantics of the language.
		Beware of the Turing tar-pit in which everything is possible but nothing of interest is easy.
		The phrase the Turing tarpit is also heard occasionally in arguments between proponents of two or more different programming languages each claiming their language is better than the other(s).
	en.wikipedia.org /wiki/Turing_tarpit (316 words)

	Turing's Thesis (Site not responding. Last check: 2007-10-13)
		Turing's thesis, also called Church's Thesis, the Church/Turing Thesis, the Turing Hypothesis, etc., is the following important assertion.
		They are equivalent to a kind of Turing machine with separate read- and write- heads that move in one direction only, with the tape in between.
		In order to show a certain function is computable by a Turing machine, it suffices to give a verbal description of a computational process, even without the use of a formal model.
	www.cs.hmc.edu /claremont/keller/webBook/ch06/sec06.html (1816 words)

	Turing machine (Site not responding. Last check: 2007-10-13)
		The concept of the Turing machine is based on the idea of a person executing a well-defined procedure by changing the contents of an infinite amount of ordered paper sheets that can contain one of a finite set of symbols.
		A Turing machine that is able to simulate any other Turing machine is called a universal Turing machine or simply a universal machine as Turing described it in 1947: :''It can be shown that a single special machine of that type can be made to do the work of all.
		On the other hand, there's one way in which Turing machines are often considered a poor model for programs: real programs, such as operating systems and word processors, often receive an unbounded amount of input over time, and never "finish" their task.
	turing-machine.kiwiki.homeip.net (2274 words)

	H2O - Educational Technology Leadership*05-06
		Turing recognized that it is not necessary to talk about how the machine carries out its actions, but merely to take as given the twin ideas that the machine can carry out the specified actions, and that those actions may be uniquely described.
		The action of a Turing machine is determined completely by (1) the current state of the machine (2) the symbol in the cell currently being scanned by the head and (3) a table of transition rules, which serve as the “program” for the machine.
		Turing machines can describe algorithms over all machines at once, regardless of how much memory they have; there is a maximum to the amount of memory any machine has now, but this limit can rise arbitrarily in time.
	h2o.law.harvard.edu /viewRotisserie.do?rotisserieId=757 (16203 words)

	Turing tarpit - Esolang
		A Turing tarpit is a language that aims for Turing-completeness in an arbitrarily small number of linguistic elements - ideally, as few as possible.
		The reader is welcome to enter the competition [to design the smallest universal Turing machine...] although the reader should understand clearly that the question is an intensely tricky puzzle and has essentially no serious mathematical interest.
		The pursuit of Turing tarpits in the esoteric programming language community, however, seems to be essentially for its own sake.
	esoteric.voxelperfect.net /wiki/Turing_tarpit (546 words)

	Beware of the Turing Tar-Pit (reddit.com)
		Turing tar-pits are Turing-complete but ususably awful to actually program in.
		After you do that, moreover, you're recognisably still programming in the lambda-calculus, while the only way to escape a real Turing tarpit (such as the TM itself) is to implement an interpreter or compiler for a completely different language and just use that - the two languages won't really integrate.
		Basically yes, although the mess you are in is not the Turing tarpit.
	programming.reddit.com /info/9dby/comments (1543 words)

	Brainfuck @ <?php /* Gi-Go */ ?>
		It is also a Turing tarpit, ie a programming language designed to be Turing-complete while minimizing the number of distinct instructions (8 commands in that case, all with 0 operands).
		A Turing machine is made of a read/write head going forward or backward along an infinite-length tape divided into cells, a stats register that stores the current state, and an actions table that tells what to do in a defined state, or rather given a state-symbol combination.
		The @number notation is used to describe the cell number number of the tape (recall the Turing machine...), ie the content of the cell number number of the array (if you prefer to stick to arrays and pointers).
	alx2002.free.fr /esoterism/brainfuck/brainfuck_en.html (938 words)

	jargon, node: Turing tar-pit (Site not responding. Last check: 2007-10-13)
		However, no machine or language exactly matching Turing's primitive set has ever been built (other than possibly as a classroom exercise), because it would be horribly slow and far too painful to use.
		A `Turing tar-pit' is any computer language or other tool that shares this property.
		That is, it's theoretically universal -- but in practice, the harder you struggle to get any real work done, the deeper its inadequacies suck you in.
	www.jargon.net /jargonfile/t/Turingtar-pit.html (99 words)

	LtU Classic Archives
		Turing completeness is oriented towards functions from input to output, while more or less ignoring interaction, time, trust, fairness.
		However, broadly interpreted Turing-completeness doesn't have anything to do with Turing machines, but rather computability itself, and so we are not talking only about a translation to Turing machines, but also anything else, like the untyped lambda-calculus or Milner's pi-calculus, which has the same computational power.
		The equivalence of all these computational models, though, means basically that, even though Turing machines don't explicitly deal with interaction or fairness or whatever, they can be dealt with indirectly by encoding.
	lambda-the-ultimate.org /classic/message12481.html (1862 words)

	Turing Tarpit
		The first such things were combinatorial logic, lambda calculus, and Turing machines, each of which can compute an computable function, and each of which is equivalent to the others by virtue of being able to simulate each of the others.
		As a small example of the "tarpit" problem with such things, typically arithmetic is expressed in unary (base 1), which requires exponentially more space, time, and programming effort to deal with than do systems that use more conventional number bases such as base two.
		Programmers often fall into the Turing tarpit when arguing about how powerful languages are.
	c2.com /cgi/wiki?TuringTarpit (584 words)

	Expressing Turing Machines as Rewrite Rules (Site not responding. Last check: 2007-10-13)
		Given two models that are both claimed to be universal with respect to computability, it is important to be able to express every partial function expressible in one model in terms of the other model and vice-versa.
		Here we show how Turing machine computations can be expressed in terms of rex rules.
		Recall that the complete state of a Turing machine consists of a control state, a tape, and a head position.
	www.cs.hmc.edu /claremont/keller/webBook/ch06/sec07.html (918 words)

	JLOUIS Ramblings: Fallacies of Java Part #1 (Site not responding. Last check: 2007-10-13)
		What is possible in one language is certainly possible in another since one can translate between the 2 by going the turing machine route.
		It is important to take the turing tarpit into consideration when faced with this fact however.
		While everything is possible, it may be a whole lot harder in one language compared to another.
	jlouisramblings.blogspot.com /2006/08/fallacies-of-java-part-1.html (1008 words)

	Open Directory - Computers: Programming: Languages: Obfuscated (Site not responding. Last check: 2007-10-13)
		False - Programming language with two main goals: confusing everyone with an obfuscated syntax, and designing as powerful a language as possible with a tiny implementation: this compiler executable is only 1024 bytes, written in pure 68000 assembler.
		Turing Tarpit - Directory of sites dealing with obfuscated programming languages.
		Waduzitdo - Turing incomplete programming language written by a guy named Larry, who's friends always asked him about his new PC: "What does it do?" Works via 2 registers: accumulator and match flag which holds one value (T or F).
	dmoz.org /Computers/Programming/Languages/Obfuscated (599 words)

	[Madlug] File based CMS (Site not responding. Last check: 2007-10-13)
		The designer may correctly say that two ways of doing things are directly isomorphic, and they may be mathmatically correct, but that way ultimately leads to the Turing Tarpit of BrainF*ck.
		The other way to go is to have many different languages which are uniquely suited to a specific task and have some way of combining them.
		They may not even be Turing Complete, but they would be very good within their domain.
	www.madisonlinux.org /pipermail/madlug/2005-May/023368.html (210 words)

	The One, The Only... TURING TAR PIT!
		The original Turing Tarpit (officially known as the Bad Languages Page until a very poorly advertised name change) was posted at my website at Boston College, and as of this writing is still there thanks to the benign neglect of its sysadmin Stefan.
		Brainf*--The ultimate in Turing Tarpits**, this language has a total of eight commands, yet can (in a stunningly tedious manner) do virtually everything any other programming language can do.
		A bit scary.) This seems to have become one of the most popular Tarpits out there; there are even at least two Brainf***.NET implementations out there (Gerson Kurz' Python compiler and Simon Harris' C/DotGNU implementation.
	www.geocities.com /connorbd/tarpit/tarpit.html (1720 words)

	Universal Turing Machines
		Turing tarpit the memory indices, which are not possible in '5.
		Turing defined this as a of the machines terminates successfully, then the entire companies, which still picking up Current in volume.
		Wayback Machine With You Put the Wayback Machine machine One way to modify the definition of Turing machine consist in specified conditions under which the enables the Turing machine to perform such a Turing machine, it is common and perhaps more the tape '3.
	machine.yourhomebook.net /computation.html (1900 words)

	Cyclic tag system - Esolang
		By encoding a tag system's alphabet as equal-length binary strings, a cyclic tag system can be designed to emulate any tag system -- thus showing the latter to be Turing-complete (since the set of tag systems is Turing-complete).
		Matthew Cook relied on cyclic tag systems to prove the Turing completeness of Stephen Wolfram's Rule 110 cellular automaton.
		Bitwise Cyclic Tag -- a Turing tarpit derived from cyclic tag.
	www.esolangs.org /wiki/Cyclic_tag_system (251 words)

	BANCStar
		The Tarpit seems primarily devoted to joke languages (though as I write I'm mulling over a request to add an APL reference to the site).
		To those who write programming languages for vertical markets, let the above nastiness be a lesson to you: security through obscurity is bad juju.
		Click here to go back to the Turing Tarpit.
	www.geocities.com /connorbd/tarpit/bancstar.html (634 words)

	2005/05/08 Turing Tarpit
		But just as you can remove nails with pliers and screws with a pair of ViseGrips, and can hammer nails with a rock, there is a matter of having the right tool for the right job.
		There is also the matter of tools so badly designed that your every attempt to use them just frustrates you more - like falling into a tarpit, every movement just seems to make things worse.
		Well, most programmers have found themselves in a tarpit now and then, whether through their own mistakes or others.
	aplawrence.com /Words2005/2005_05_08.html (211 words)

	Turing machine - Wikipedia, the free encyclopedia
		Blanks (in this case represented by "0"s) can be part of the total state as shown here: B01 ; the tape has a single 1 on it, but the head is scanning the 0 ("blank") to its left and the state is B.
		The "3-state busy beaver" Turing Machine in a finite state representation.
		On the far right is the Turing "complete configuration" (Kleene "stuation", Hopcroft-Ullman "instantaneous description") at each step.
	en.wikipedia.org /wiki/Turing_machine (4349 words)

	xslt automata - Re: equivalentTo vs. XSLT (Site not responding. Last check: 2007-10-13)
		First, those verifiers are typically buggy as hell because they are brutal to implement.
		Second, you invariably run into the Turing tarpit when trying to detect DOS.
		Turing completeness will in general prevent you from detecting when that is possible or not.
	www.stylusstudio.com /xmldev/200211/post20360.html (1015 words)

	Turing completeness - Wikipedia, the free encyclopedia
		For the usage of this term in Turing reductions, see Turing complete set.
		The gap from the 1830s to the 1940s was not a continuous "mechanical computer" development.
		Most programming languages, conventional and unconventional, are Turing-complete.
	en.wikipedia.org /wiki/Turing-complete (905 words)

	Obfuscated (Site not responding. Last check: 2007-10-13)
		Iota is unambiguous Turing complete language with only 2 symbols, heavily uses lambda calculus.
		Jot is Iota variant with elegant Goedel numbering.
		Turing incomplete programming language written by a guy named Larry, who's friends always asked him about his new PC: "What does it do?" Works via 2 registers: accumulator and match flag which holds one value (T or F).
	www.miatrade.net /Top/Computers/Programming/Languages/Obfuscated (527 words)

	[No title] (Site not responding. Last check: 2007-10-13)
		Mathematical Models of Interactive Computing Dina Q Goldin Math/CS Dept, U. Mass / Boston Interactive computational processes allow for input and output to take place during the computation, in contrast to the traditional models such as Turing machines where computation accepts predefined input and transforms it into output.
		Recent developments of set theory and algebra provide a formal foundation for interactive models of computation, allowing us to conclude that the interactive paradigm pulls computer science out of the "Turing tarpit".
		We will also examine applications of our work to areas such as sequential and distributed interactive systems, the Turing test, empirical models, and Church's thesis.
	www.cs.umb.edu /~dqg/talks/umbc.abstract (144 words)

	[No title] (Site not responding. Last check: 2007-10-13)
		In other forms of description, one often finds a tendency to sweep disadvantages under the rug, and claim universal solutions.
		What's worse, computer language solutions often are universal in the trivial sense --- it is very easy to make a turing complete language (The Turing Tarpit).
		Leslie Lamport in his article on "Temporal Logic of Actions" says that formalisms should have limited domains of application --- "a formalism suitable for everything is good for nothing".
	choices.cs.uiuc.edu /Papers/sane/patterns/why.doc (675 words)

Try your search on: Qwika (all wikis)