Preferred Name | Algorithm | |
Synonyms |
|
|
Definitions |
An algorithm is a plan which describes inputs, output of mathematical functions as well as workflow of execution for achieving an predefined objective. Algorithms are realized usually by means of implementation as computer programs for execution by automata. |
|
ID |
http://uri.neuinfo.org/nif/nifstd/birnlex_11009 |
|
change note |
Definition and defining source has been added. |
|
createdDate |
2007-10-05 |
|
definition |
An algorithm is a plan which describes inputs, output of mathematical functions as well as workflow of execution for achieving an predefined objective. Algorithms are realized usually by means of implementation as computer programs for execution by automata. |
|
editorial note |
This is a proxy class to be replaced by its OBI equivalent, once there is an official release built off BFO v1.1 that can be successfully classified using Pellet v1.5.0 in Protege. http://uri.neuinfo.org/nif/nifstd/readable/graph_position_temporary |
|
externalSourceURI | ||
hasBirnlexCurator | ||
hasCurationStatus |
http://uri.neuinfo.org/nif/nifstd/readable/graph_position_temporary |
|
hasDefinitionSource | ||
label |
Algorithm |
|
modifiedDate |
December 15, 2008 2007-10-05 |
|
note |
An algorithm is a plan which describes inputs, output of mathematical functions as well as workflow of execution for achieving an predefined objective. Algorithms are realized usually by means of implementation as computer programs for execution by automata. This is a proxy class to be replaced by its OBI equivalent, once there is an official release built off BFO v1.1 that can be successfully classified using Pellet v1.5.0 in Protege. Definition and defining source has been added. http://uri.neuinfo.org/nif/nifstd/readable/graph_position_temporary |
|
preferred label |
Algorithm |
|
prefixIRI |
NIFSTD:birnlex_11009 |
|
subClassOf |