Blown To Bits

You Saw It Here First

Thursday, October 28th, 2010 by Harry Lewis

The Massachusetts Statute that was the subject of my last blog entry has been ruled unconstitutional by a federal judge.

My guess is that this ruling sticks if it is challenged. The legislature was given the opportunity to fix a problem and instead did what it figure would be politically popular, to legislate safety over free speech. Back to the drawing board, folks.

One Response to “You Saw It Here First”

  1. Martin Says:

    I have faced censorship.

    Lizhi Du
    College of Computer Science and Technology,
    Wuhan University of Science and Technology, Wuhan 430081, P.R. of China
    Tel: 86 13554171855


    Consider this a post in the future:
    Identification in Limited Language
    Copyright (C) 2011 by
    The MEAMI.ORG Company
    Investigate and learn languages refer to situations: a class of specific possible languages with a way to present information to a learner about an unknown language to be chosen from the class. The question is implicit, “What information is sufficient to determine the possible languages of the unknown language?” Definitions of what we may learn are possible, but only considered here: time is a quantity and has a finite amount of time to start. Each time a learner receives units of information to guess the identity of the unknown language on the basis of information received thus far. The process continues forever. Consider the class of languages learn-able with respect to specific methods to present information if a learner uses an algorithm to make guesses then this algorithm has a property: given any language of the class there is finite time after the guesses when all of them will be the same and correct. Preliminarily investigations of language take a language to be a finite set of alphabet strings. The alphabet is the same for all languages of the class. Investigate numerous variations of two specific methods to present information: a text for a language generates strings of the language in any order so every string of the language occurs at least once. An informant for a language tells us if a string in the language chooses strings so every string occurs at least once. Found inside the class of context-sensitive learn-able languages from an informant outside the class of regular language learn-able from the text.
    1. MOTIVE: SPEAK THE LANGUAGE The study of how to identify a language here derives from and motivates artificial intelligence. These methods us results and the *Present address: Institute for Formal Computation, 20405 Vance Street Northwest, Elk River, Minnesota 55330-2267. Present sponsor: Scott Aaronson, Massachusetts Institute of Technology (aaronson at csail dot mit edu)