Makadara Law Courts will remain closed until June 17 following a shooting incident on Thursday, Chief Justice Martha Koome has said.
In a statement, the CJ said the closure will facilitate the security reinforcement at the court.
“All matters at the Makadara Law Courts will be heard virtually and those requiring physical appearance mentioned at the Milimani Law Courts,” the CJ ordered.
Koome further said the office of the Inspector General and connected National Council on the Administration of Justice (NCAJ) actors will review the security protocols regarding the handling of accused persons in the courtroom.
“The Judiciary Police Unit in consultation with the office of the Inspector General will reinforce security in all court stations across the country and ensure that persons are not allowed to access court premises while armed with the exception of officers properly accredited to provide security at specified court sessions,” the CJ directed.
On Thursday afternoon, a senior police officer was shot and killed by court orderlies at the Makadara Law Courts after he shot and injured a magistrate.
The officer was apparently irked by Principal Magistrate Monicah Kivuti’s decision to cancel his wife’s bond terms and order remand her in custody for skipping previous court sessions.
The accused told the court that she had been unwell prompting the magistrate to direct that a probation report be prepared whilst the accused remained in custody.
“The perpetrator then entered the court through the magistrate’s entrance and fired shots at Hon Kivuti injuring her severally on the chest and pelvic area,” CJ Koome said.
She said a court orderly and two other officers who tried to secure the magistrate and remove her from harm’s way also sustained gunshot wounds.
So to things:1) It depends entirely on the task you are trying to parallelize “Nick’s class” or “NC” is the category of algorithms considered to parallelize well, while “P” is the class of algorithms that are generally considered tractable to implement and run in a single threaded manner That is the same P as the P versus NP debate, and it’s generally considered that P is not likely equal to NP, and NC is not likely equal to P That whole there are no problem concrete examples, it’s expected that some tractable single threaded algorithms do not parallelize well 2) The number of lines in a program tells you literally nothing about it’s runtime If they only run once each in order, even an e-core of a older budget chip will handle 2000 lines of script faster than you can blink On the other hand, even a few hundred lines would be more than sufficient to (try to) print out the Goodstein sequence of an input number For an input of 3, this runs quickly, outputting 6 numbers For an input of 4 it will eventually to output over 1e100,000,000 numbers, most with over 100 million digits each Determining how long a program can run based on just on the program size is actually so difficult that it is *literally impossible*