User contributions for Jiri 1984
Results for Jiri 1984 talk block log uploads logs global block log global account filter log
A user with 83 edits. Account created on 15 January 2011.
2 December 2013
- 10:2910:29, 2 December 2013 diff hist 4 Code page →Code pages for DBCS character sets: "character encoding" is fewer ambiguous than "character set"
10 November 2013
- 12:1512:15, 10 November 2013 diff hist 6 Character (computing) →Terminology: "encoding forms" changed to "coded character sets" as it is defined by the Unicode Standard. The core issue is that the "encoding form" as defined by this standard is not bit-agnostic, as it maps the numerical code points to code units
29 October 2013
- 20:0120:01, 29 October 2013 diff hist 425 Talk:Unicode control characters →Note: Control characters are those with General Category value Cc: new section
12 May 2013
- 16:1916:19, 12 May 2013 diff hist −1 Boolean algebra →Variables: Copyedit of the phrase: As the decimal digit normally represents the numbers, the truth values are represented by the binary digit ("bit")
- 01:1601:16, 12 May 2013 diff hist 8 Ternary numeral system No edit summary
- 01:1501:15, 12 May 2013 diff hist −13 Ternary numeral system No edit summary
21 April 2013
- 14:3714:37, 21 April 2013 diff hist 385 Talk:ISO/IEC 646 →Circumflex accent in table: new section
10 April 2013
- 10:4010:40, 10 April 2013 diff hist 32 Endianness 256 values are representable by one byte, conventionaly interpreted as 0 - 255, when unsigned notation is considered.
26 December 2012
- 13:0213:02, 26 December 2012 diff hist 16 Indexed family →Functions, sets and families: Notation according the above
24 December 2012
- 16:5516:55, 24 December 2012 diff hist 5 Indexed family →Matrices: I think that it is incorrect to consider indexed family as the multiset, because multiset has no associated index set giving some structure to it (two instances of some element in multiset are not distinguishable)
- 11:1211:12, 24 December 2012 diff hist 6 Indexed family →Functions, sets and families: The function from I to X is bringing some structure to 'X'
2 December 2012
- 15:1915:19, 2 December 2012 diff hist 1 Boolean function The Boolean function can be expressed by the propositional formula and the propositional formula is, in fact, the Boolean formula.
3 November 2012
17 July 2012
- 17:1017:10, 17 July 2012 diff hist −16 Vector space →Function spaces: Probably better to speak about subsets of R in this context
15 July 2012
- 17:3217:32, 15 July 2012 diff hist −37 Spaghetti code Undid revision 502455612 by Jiri 1984 (talk)
- 17:0617:06, 15 July 2012 diff hist 37 Spaghetti code Undid revision 502448933 by Jiri 1984 (talk)
- 16:3416:34, 15 July 2012 diff hist −37 Spaghetti code →Ravioli code: Using "modules" instead "objects". From my opinion, the term "object" in this context should be ambiguous.
29 June 2012
16 May 2012
- 11:5711:57, 16 May 2012 diff hist 36 Syntactic monoid →Syntactic quotient
- 11:3311:33, 16 May 2012 diff hist −11 Syntactic monoid →Syntactic monoid: Making some parts more general a more specifying some aspects in monoid - automaton relation
- 11:2811:28, 16 May 2012 diff hist 69 Syntactic monoid →Syntactic monoid
17 April 2012
12 April 2012
- 18:0718:07, 12 April 2012 diff hist 7 Regular expression →Formal definition: I thing it is more proper to talk about operator symbols in expressions.
27 March 2012
26 March 2012
- 13:5613:56, 26 March 2012 diff hist 1 Formal grammar No edit summary
- 13:5513:55, 26 March 2012 diff hist 11 Formal grammar Subsumption of formal language theory into theoretical computer science
18 March 2012
8 March 2012
- 18:1218:12, 8 March 2012 diff hist 95 Model of computation No edit summary
21 February 2012
- 16:0616:06, 21 February 2012 diff hist 764 Free monoid →Examples
17 February 2012
- 15:5715:57, 17 February 2012 diff hist 10 Formal theory Undid revision 477372845 by Jiri 1984 (talk)
- 14:4814:48, 17 February 2012 diff hist −10 Formal theory I thing, the axiomatic system is everytime representable by symbols and operators. Plese, correct me, if it is not so.
8 February 2012
- 12:4812:48, 8 February 2012 diff hist −82,524 Algorithm Undid revision 475749420 by Jiri 1984 (talk)
- 12:2312:23, 8 February 2012 diff hist 46 Algorithm Considering the algorithm as the theoretical approach, not yet directly implemented as list of instructions
7 February 2012
- 13:2413:24, 7 February 2012 diff hist −3 Halting problem →Importance and consequences: I have changed "algorithm " to "method" - for the case it doesn't halt because from definition of an algorithm follows that algorithm MUST halt.
4 February 2012
31 January 2012
- 19:5019:50, 31 January 2012 diff hist 33 Instruction Undid revision 474265162 by Jiri 1984 (talk)
- 19:4619:46, 31 January 2012 diff hist −33 Instruction Undid revision 474261817 by Jiri 1984 (talk)
- 19:3919:39, 31 January 2012 diff hist 32 Instruction set architecture →Machine language
- 19:2819:28, 31 January 2012 diff hist 19 Operation No edit summary
- 19:2619:26, 31 January 2012 diff hist 33 Instruction Undid revision 474259151 by Jiri 1984 (talk)
- 19:1219:12, 31 January 2012 diff hist −33 Instruction Undid revision 474258042 by Jiri 1984 (talk)
- 19:0619:06, 31 January 2012 diff hist 33 Instruction Think this is better - operation is some procedure, which is performed under authority of the instruction
27 January 2012
- 23:2423:24, 27 January 2012 diff hist 45 Automata theory No edit summary
- 13:2213:22, 27 January 2012 diff hist 164 Regular expression →Formal definition: I distinguished the syntax of RE from its semantics (taking the language to be DESCRIBED by the expression)
25 January 2012
12 January 2012
- 13:2613:26, 12 January 2012 diff hist 75 Binary number →Counting in binary: more accurate notion of represantation of numbers
8 January 2012
- 12:5312:53, 8 January 2012 diff hist 78 Material conditional →Formal properties
- 12:2012:20, 8 January 2012 diff hist 0 Material conditional →Formal properties: If for a relation "->" holds a -> a, this is property of reflexivity rather than idempotency. To be idempotent truth value of "a->a" must be equal to "a" what is not in case that "a" is false.
7 January 2012
- 12:0312:03, 7 January 2012 diff hist −1 Free Boolean algebra Based on the explanation, indpendent are elements of X, some elements of FX depend on element of X at least, so are mutualy dependent
3 January 2012
- 15:0115:01, 3 January 2012 diff hist 0 Gödel numbering No edit summary
