Hello,

More of my philosophy about technology and about my implementation of a future and more of my thoughts..

I am a white arab, and i think i am smart since i have also
invented many scalable algorithms and algorithms..

My portable and efficient implementation of a future in Delphi and FreePascal was updated to version 1.31

I have just added support for exceptions, so you have to know that
programming with futures is asynchronous programming, but so that
to be robust the future implementation has to deal correctly
with "exceptions", so in my implementation of a future when an exception
is raised inside the future you will receive the exception, so
i have implemented two things: The HasException() method so that to detect the exception from inside the future, and the the exception and its address is returned as a string in the ExceptionStr property, and my implementation of a future does of course support passing parameters as a pointer to the future, also my implementation of a future works in Windows and Linux.

You can download my portable and efficient implementation of a future in Delphi and FreePascal version 1.31 from my website here:

https://sites.google.com/site/scalable68/a-portable-and-efficient-implementation-of-a-future-in-delphi-and-freepascal

And here is an example program of how to use my implementation of a future in Delphi and Freepascal:

--

program TestFuture;

uses system.SysUtils, system.Classes, Futures;
type

TTestFuture1 = class(TFuture)
public
function Compute(ptr:pointer): Variant; override;
end;

TTestFuture2 = class(TFuture)
public
function Compute(ptr:pointer): Variant; override;
end;

var obj1:TTestFuture1;
obj2:TTestFuture2;
a:variant;

function TTestFuture1.Compute(ptr:pointer): Variant;
begin

raise Exception.Create('I raised an exception');

end;

function TTestFuture2.Compute(ptr:pointer): Variant;
begin

writeln(nativeint(ptr));
result:='Hello world !';

end;

begin

writeln;

obj1:=TTestFuture1.create();

obj1.SetParameter(pointer(12));

obj1.Start;

if obj1.GetValue(a) then writeln(a)
else if obj1.HasException then writeln(obj1.ExceptionStr);

obj1.free;

writeln;

obj2:=TTestFuture2.create();

obj2.SetParameter(pointer(12));

obj2.Start;

if obj2.GetValue(a) then writeln(a);

obj2.free;

end.

---

More of my philosophy about quantum computing and about matrix operations and about scalability and more of my thoughts..

I think i am highly smart since I have passed two certified IQ tests and i have scored "above" 115 IQ, i have just looked at the following
video about the powerful parallel quantum computer of IBM from USA that will be soon available in the cloud, and i invite you to look at it:

Quantum Computing: Now Widely Available!

https://www.youtube.com/watch?v=laqpfQ8-jFI

But i have just read the following paper and it saying that the powerful Quantum algorithms for matrix operations and linear systems of equations are available, read about them on the below paper, so as you notice in the following paper that many matrix operations and also the linear systems of equations solver can be done in a quantum computer, read about it here in the following paper:

Quantum algorithms for matrix operations and linear systems of equations

Read more here:

https://arxiv.org/pdf/2202.04888.pdf

So i think that IBM will do the same for there powerful parallel quantum computer that will be available in the cloud, but i think that you will have to pay for it of course since i think it will be commercial, but i think that there is a weakness with this kind of configuration of the powerful parallel quantum computer from IBM, since the cost of bandwidth of internet is exponentially decreasing , but the latency of accessing the internet is not, so it is why i think that people will still use classical computers for many mathematical applications that uses mathematical operations such as matrix operations and linear systems of equations etc. that needs a much faster latency, other than that Moore's law will still be effective in classical computers since it will permit us to have really powerful classical computer at a low cost and it will be really practical since the quantum computer is big in size and not so practical, so read about the two inventions below that will make logic gates thousands of times faster or a million times faster than those in existing computers so that to notice it, so i think that the business of classical computers will still be great in the future even with the coming of the powerful parallel quantum computer of IBM, so as you notice this kind of business is not only dependent on Moore's law and Bezos’ Law , but it is also dependent on the latency of accessing internet, so read my following thoughts about Moore’s law and about Bezos’ Law:

More of my philosophy about Moore’s law and about Bezos’ Law..

For RAM chips and flash memory, Moore's Law means that in eighteen months you'll pay the same price as today for twice as much storage.
But other computing components are also seeing their price versus performance curves skyrocket exponentially. Data storage doubles every twelve months..

More about Moore’s law and about Bezos’ Law..

"Parallel code is the recipe for unlocking Moore’s Law"

And:

"BEZOS’ LAW

The Cost of Cloud Computing will be cut in half every 18 months - Bezos’ Law

Like Moore’s law, Bezos’ Law is about exponential improvement over time. If you look at AWS history, they drop prices constantly. In 2013 alone they’ve already had 9 price drops. The difference; however, between Bezos’ and Moore’s law is this: Bezos’ law is the first law that isn’t anchored in technical innovation. Rather, Bezos’ law is anchored in confidence and market dynamics, and will only hold true so long as Amazon is not the aggregate dominant force in Cloud Computing (50%+ market share). Monopolies don’t cut prices.."

More of my philosophy about latency and contention and concurrency and parallelism and more of my thoughts..

I think i am highly smart and i have just posted, read it below,
about the new two inventions that will make logic gates thousands of times faster or a million times faster than those in existing computers,
and i think that there is still a problem with those new inventions,
and it is about the latency and concurrency, since you need concurrency
and you need preemptive or non-preemptive scheduling of the coroutines ,
so since the HBM is 106.7 ns in latency and the DDR4 is 73.3 ns in latency and the AMD 3D V-Cache has also almost the same cost in latency, so as you notice that this kind of latency is still costly , also there is a latency that is the Time slice that takes a coroutine to execute and it is costly in latency, since this kind of latency and Time slice is a waiting time that looks like the time wasted in a contention in parallelism, so by logical analogy this kind of latency and Time slice create like a contention like in parallelism that reduces scalability, so i think it is why those new inventions have this kind of limit or constraints in a "concurrency" environment..

And i invite you to read my following smart thoughts about preemptive and non-preemptive timesharing:

https://groups.google.com/g/alt.culture.morocco/c/JuC4jar661w

More of my philosophy about Fastest-ever logic gates and more of my thoughts..

"Logic gates are the fundamental building blocks of computers, and researchers at the University of Rochester have now developed the fastest ones ever created. By zapping graphene and gold with laser pulses, the new logic gates are a million times faster than those in existing computers, demonstrating the viability of “lightwave electronics.”. If these kinds of lightwave electronic devices ever do make it to market, they could be millions of times faster than today’s computers. Currently we measure processing speeds in Gigahertz (GHz), but these new logic gates function on the scale of Petahertz (PHz). Previous studies have set that as the absolute quantum limit of how fast light-based computer systems could possibly get."

Read more here:

https://newatlas.com/electronics/fastest-ever-logic-gates-computers-million-times-faster-petahertz/

Read my following news:

And with the following new discovery computers and phones could run thousands of times faster..

Prof Alan Dalton in the School of Mathematical and Physics Sciences at the University of Sussex, said:

"We're mechanically creating kinks in a layer of graphene. It's a bit like nano-origami.

"Using these nanomaterials will make our computer chips smaller and faster. It is absolutely critical that this happens as computer manufacturers are now at the limit of what they can do with traditional semiconducting technology. Ultimately, this will make our computers and phones thousands of times faster in the future.

"This kind of technology -- "straintronics" using nanomaterials as opposed to electronics -- allows space for more chips inside any device. Everything we want to do with computers -- to speed them up -- can be done by crinkling graphene like this."

Dr Manoj Tripathi, Research Fellow in Nano-structured Materials at the University of Sussex and lead author on the paper, said:

"Instead of having to add foreign materials into a device, we've shown we can create structures from graphene and other 2D materials simply by adding deliberate kinks into the structure. By making this sort of corrugation we can create a smart electronic component, like a transistor, or a logic gate.."