User contributions
Jump to navigation
Jump to search
- 22:07, 3 August 2006 diff hist +4 m Chaitin's construction binding after parser |item|
- 22:02, 3 August 2006 diff hist +5 m Chaitin's construction rephrasing
- 21:59, 3 August 2006 diff hist +17 m Chaitin's construction LL(1) grammar, not LL(0)
- 21:51, 3 August 2006 diff hist +263 Chaitin's construction →Decoding: More clear distinction between LL(k) parser and LL(k) grammar
- 21:29, 3 August 2006 diff hist +24 m Chaitin's construction typographic corrections, rephrasings
- 21:10, 3 August 2006 diff hist +680 Chaitin's construction Rephrasings, annotations, and code examples for partial function approach and total function approach
- 17:29, 3 August 2006 diff hist 0 m Chaitin's construction Reaneming >>^ to >>@ (in the sense of liftM2 apply), because arrows use also symbol >>^ in another sense (p >>^ f = p >>> arr f)
- 17:11, 3 August 2006 diff hist +46 m Chaitin's construction Small rephrasing of headlines
- 17:06, 3 August 2006 diff hist +26 m Chaitin's construction Small corrections
- 17:02, 3 August 2006 diff hist +127 m Chaitin's construction Fixing import/export lists of modules
- 16:48, 3 August 2006 diff hist +1,825 Chaitin's construction Defining decode function in Haskell
- 14:01, 3 August 2006 diff hist +4 m Chaitin's construction Putting verb in a sentence which consisted only of a huge noun phrase
- 13:53, 3 August 2006 diff hist +3 m Chaitin's construction Spell-check with ispell
- 13:46, 3 August 2006 diff hist -13 m Chaitin's construction No indenting for bash code
- 13:39, 3 August 2006 diff hist +45 Combinatory logic →Applications: Referring to Chaitin's construction, which can show why combinatory logic can be important in other areas of mathematics
- 13:32, 3 August 2006 diff hist +154 Chaitin's construction →Basing it on combinatory logic: Formula, that range of coding function equals to domain of decoding function
- 13:19, 3 August 2006 diff hist +419 Chaitin's construction →To do: Writing software for making conjectures in this topic
- 11:45, 3 August 2006 diff hist +189 m Chaitin's construction →Introduction: Writing an introductory text -- asking the motivating question of the topic
- 11:39, 3 August 2006 diff hist +50 m Chaitin's construction The set of syntactiaclly correct bitstring codings of combinatory logic is exactly both the domain of decoding and range of coding function
- 11:28, 3 August 2006 diff hist 0 m Chaitin's construction I had confused e.g. (exempla gratia) with i.e. (idem esse). Now I have corrected it